检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:廉师友[1]
机构地区:[1]西安石油大学计算机学院,陕西西安710065
出 处:《西安石油大学学报(自然科学版)》2005年第5期78-80,共3页Journal of Xi’an Shiyou University(Natural Science Edition)
基 金:21世纪初中国高等教育人才培养体系的创新与实践项目(编号:C450)
摘 要:分配调度问题是一种困难问题,有些甚至是NP完全类问题.因而解决此类问题的技术难度较大,一般采用与或图搜索技术来求解.这就给当前许多Web数据库系统中的分配调度程序的编制造成困难,笔者以毕业设计任务分配算法为例,给出了一个能解决一类约束条件为双向选择的分配调度问题的通用算法.该算法不涉及复杂数据结构和搜索过程,仅用关系数据库的表操作描述,并可用任一支持Web数据库的语言编程实现.Distributing and dispatching is a kind of difficult problem and some are even NPC problems. Therefore, it is more difficult to solve this kind of problems and generally the technology of AND-OR graph search is used to solve them. This results in some difficulties in programming the distributing and dispatching program in web database systems. In the paper, with the distribution of student graduation design tasks being taken as an example, a general algorithm is given which can solve a kind of distributing and dispatching problem with the restraining condition of each other choosing. This algorithm does not involve complex data structures and searching process, it is only described by the table operations of relation database, and it can be realized through programming in any language which supports Web database.
分 类 号:TP393.092[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3