Sciweavers

1102 search results - page 97 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
COCOA
2009
Springer
14 years 3 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 7 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
FCS
2007
13 years 10 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
14 years 3 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
AIPS
2003
13 years 10 months ago
A Multi-Agent System-driven AI Planning Approach to Biological Pathway Discovery
As genomic and proteomic data is collected from highthroughput methods on a daily basis, subcellular components are identified and their in vitro behavior is characterized. Howev...
Salim Khan, William Gillis, Carl Schmidt, Keith De...