检索结果-内蒙古大学图书馆

6th International Conference on Artificial Intelligence planning Systems, AIPS 2002

ISBN: (纸本)1577351428

the proceedings contain 34 papers. the topics discussed include: speculative execution for information gathering plans;filtering algorithms for batch processing with sequence dependent setup times;estimated-regression planning for interactions with web services;planning for distributed execution through use of probabilistic opponent models;heuristic search-based replanning;a plan-based personalized cognitive orthotic;fragment-based conformant planning;constraint model-based planning and scheduling with multiple resources and complex collaboration schema;universal quantification in a constraint-based planner;execution monitoring with quantitative temporal Bayesian networks;planning technology for intelligent cognitive orthotics;extending the exploitation of symmetries in planning;LPG: a planner based on local search for planning graphs with action costs;and local search topology in planning benchmarks: a theoretical analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A formal mapping of static information models into dynamic models for process planning and control purposes 6

A formal mapping of static information models into dynamic m...

引用

6th International workshop on Discrete Event Systems (WODES 02)

作者： Falkman, P Nielsen, J Lennartson, B Chalmers Univ Technol Dept Signals & Syst Control & Automat Lab S-41296 Gothenburg Sweden

ISBN: (纸本)0769516831

A formal mapping between static information models and dynamic models is presented. the static information models are given according to an international standard for product, process and resource information exchange. the dynamic models are described as Discrete Event Systems. the product, process and resource information is automatically converted into product routes and used for simulation, controller synthesis and verification. the focus in this paper is on resource booking problems. A high level language, which combines Petri nets and process algebra, is presented and used for specification of desired routes. A main implication of this methodology is to enable the reuse of process information when creating dynamic models for process control. this method also enables simulation and verification to be conducted early in the development.

关键词： modelling methodologies Petri nets process algebra.

来源：评论

学校读者我要写书评

暂无评论

Coloring algorithms for tolerance graphs: Reasoning and scheduling with interval constraints 6th

引用

Joint Conferences on 6th Artificial Intelligence and Symbolic Computation, AISC 2002 and 10th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2002

作者： Golumbic, Martin Charles Siani, Assaf Dept. of Computer Science University of Haifa Haifa Israel Dept. of Computer Science Bar-Ilan University Ramat-Gan Israel

ISBN: (纸本)3540438653

Interval relations play a significant role in constraint-based temporal reasoning, resource allocation and scheduling problems. For example, the intervals may represent events in time which may conflict or may be compatible, or they may represent tasks to be performed according to a timetable which must be assigned distinct resources like processors or people. In previous work [G93, GS93, G98], we explored the interaction between the interval algebras studied in artificial intelligence and the interval graphs and orders studied in combinatorial mathematics, extending results in both disciplines. In this paper, we investigate algorithmic problems on tolerance graphs, a family which generalizes interval graphs, and which therefore have broader application. Tolerance graph models can represent qualitative and quantitative relations in situations where the intervals can tolerate a certain degree of overlap without being in conflict. We present a coloring algorithm for a tolerance graph on n vertices whose running time is O(n2), given the tolerance representation, thus improving previously known results. the coloring problem on intervals has direct application to resource allocation and scheduling temporal processes. © Springer-Verlag Berlin Heidelberg 2002.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2001

引用

6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2001

ISBN: (纸本)9783540424642

the proceedings contain 71 papers. the special focus in this conference is on Decision theory and Partially Observable Markov Decision Processes. the topics include: Graphical models as languages for computer assisted diagnosis and decision making;planning with uncertainty and incomplete information;what's your preference? and how to express and implement it in logic programming!;on preference representation on an ordinal scale;rule-based decision support in multicriteria choice and ranking;propositional distances and preference representation;value iteration over belief subspace;space-progressive value iteration: an anytime algorithm for a class of POMDPS;reasoning about intentions in uncertain domains;troubleshooting with simultaneous models;a rational conditional utility model in a coherent framework;probabilistic reasoning as a general unifying tool;an operational view of coherent conditional previsions;decomposition of influence diagrams;mixtures of truncated exponentials in hybrid Bayesian networks;importance sampling in Bayesian networks using antithetic variables;using recursive decomposition to construct elimination orders, join trees, and Dtrees;caveats for causal reasoning with equilibrium models;supporting changes in structure in causal model construction;the search of causal orderings: a short cut for learning belief networks;stochastic local algorithms for learning belief networks: searching in the space of the orderings;sequential valuation networks: a new graphical technique for asymmetric decision problems;a two-steps algorithm for min-based possibilistic causal networks and computing intervals of probabilities with simulated annealing and probability trees.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An equitable approach to the payment scheduling problem in project management

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年第2期127卷 262-278页

作者： Ulusoy, G Cebelli, S Sabanci Univ Fac Engn & Nat Sci TR-81474 Istanbul Turkey Koc Holding Co Automot Grp TR-81020 Istanbul Turkey

this study reports on a new approach to the payment scheduling problem. In this approach, the amount and timing of the payments made by the client and received by the contractor are determined so as to achieve an equitable solution. An equitable solution is defined as one where both the contractor and the client deviate from their respective ideal solutions by an equal percentage. the ideal solutions for the contractor and the client result from having a lump sum payment at the start and end of the project, respectively. A double-loop genetic algorithm (GA) is proposed to solve for an equitable solution. the outer loop represents the client and the inner loop the contractor. the inner loop corresponds to a multi-mode resource-constrained project scheduling problem (RCPSP) with the objective of maximizing the contractor's net present value (NPV) for a given payment distribution. When searching for an equitable solution, information flows between the outer and inner loops regarding the payment distribution over the event nodes and the timing of these payments. An example problem is solved and analyzed. A set of 93 problems from the literature are solved and some computational results are reported. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： project management genetic algorithms payment scheduling problem

来源：评论

学校读者我要写书评

暂无评论

A polynomial algorithm for the three-machine open shop with a bottleneck machine

引用

ANNALS OF OPERATIONS RESEARCH 1999年 92卷 185-210页

作者： Drobouchevitch, IG Strusevich, VA Univ Greenwich Sch Comp & Math Sci London SE18 6PF England

the paper considers the three-machine open shop scheduling problem to minimize the makespan. It is assumed that each job consists of at most two operations, one of which is to be processed on the bottleneck machine, the same for all jobs. A new lower bound on the optimal makespan is derived, and a linear-time algorithm for finding an optimal non-preemptive schedule is presented.

关键词： open shop scheduling lower bound polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

6th International workshop on algorithms and Data Structures, WADS 1999

引用

6th International workshop on algorithms and Data Structures, WADS 1999

ISBN: (纸本)3540662790

the proceedings contain 35 papers. the special focus in this conference is on algorithms and Data Structures. the topics include: Optimization over k-set polytopes and efficient k-set enumeration;line simplification with restricted orientations;the T-join problem in sparse graphs;resizable arrays in optimal time and space;efficient evaluation of minimal perfect hash functions;design and analysis of algorithms for shared-memory multiprocessors;on the complexity of orthogonal compaction;optimizing constrained offset and scaled polygonal annuli;a generalization of the competitive ratio;performance guarantees for the TSP with a parameterized triangle inequality;robot map verification of a graph world;searching rectilinear streets completely;general multiprocessor task scheduling;the lazy bureaucrat scheduling problem;generating 3D virtual populations from pictures of a few individuals;testing the quality of manufactured balls;on an optimal split tree problems;representing trees of higher degree;indexing and dictionary matching with one error;new results on fault tolerant geometric spanners;efficient dynamic arrays for rank-based sequences;go-with-the-winner heuristic;2-point site voronoi diagrams;a parallel algorithm for finding the constrained voronoi diagram of line segments in the plane;position-independent street searching;approximation algorithms for 3-D common substructure identification in drug and protein molecules and a tight bound for beta-skeleton of minimum weight triangulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the lazy bureaucrat scheduling problem 6th

引用

6th International workshop on algorithms and Data Structures, WADS 1999

作者： Arkin, Esther M. Bender, Michael A. Mitchell, Joseph S. B. Skiena, Steven S. Department of Applied Mathematics and Statistics Stony BrookNY11794 United States Department of Computer Science State University of New York Stony BrookNY11794 United States

ISBN: (纸本)3540662790

We introduce a new class of scheduling problems in which the optimization is performed by the worker (single "machine") who performs the tasks. the worker’s objective may be to minimize the amount of work he does (he is "lazy"). He is subject to a constraint that he must be busy when there is work that he can do;we make this notion precise, particularly when preemption is allowed. the resulting class of "perverse" scheduling problems, which we term "Lazy Bureaucrat problems," gives rise to a rich set of new questions that explore the distinction between maximization and minimization in computing optimal schedules. © Springer-Verlag Berlin Heidelberg 1999.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

6th Scandinavian workshop on Algorithm theory, SWAT 1998

引用

6th Scandinavian workshop on Algorithm theory, SWAT 1998

ISBN: (纸本)3540646825

the proceedings contain 31 papers. the special focus in this conference is on Algorithm theory. the topics include: Recent developments in maximum flow algorithms;approximation algorithm for weighted shortest paths on polyhedral surfaces;facility location with dynamic distance functions;an approximation scheme for bin packing with conflicts;approximations for the general block distribution of a matrix;an optimal algorithm for computing visible nearest foreign neighbors among colored line segments;moving an angle around a region;models and motion planning;constrained square-center problems;worst-case efficient external-memory priority queues;simple confluently persistent catenable lists;improved upper bounds for time-space tradeoffs for selection with limited storage;probabilistic data structures for priority queues;extractors for weak random sources and their applications;comparator networks for binary heap construction;two-variable linear programming in parallel;optimal deterministic protocols for mobile robots on a grid;concurrent multicast in weighted networks;some recent strong inapproximability results;minimal elimination of planar graphs;memory requirements for table computations in partial k-tree algorithms;formal language constrained path problems;local search algorithms for sat;speed is more powerful than clairvoyance;randomized online multi-threaded paging;solving fundamental problems on sparse-meshes;output-sensitive cell enumeration in hyperplane arrangements and fast and efficient computation of additively weighted voronoi cells for applications in molecular biology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

algorithms for minclique scheduling problems

引用

DISCRETE APPLIED MAthEMATICS 1997年第1-2期72卷 115-139页

作者： Jurisch, B Kubiak, W Jozefowska, J MEM UNIV NEWFOUNDLAND FAC BUSINESS ADMST JOHNSNF A1C 5S7CANADA POZNAN TECH UNIV INST COMP SCIPL-60965 POZNANPOLAND

We consider a family of well-known scheduling problems that reduce to the problem of finding a minimum weighted clique in a complete weighted graph with negative weights and self-loops allowed. We present a uniform algorithmic approach to finding optimal as well as suboptimal solutions for these problems. Also, we report results of computational tests for suboptimal algorithms developed in the paper.

关键词： single/multiple machine scheduling minimum weighted clique dynamic programming spectral algorithms tabu search

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：