Sciweavers

388 search results - page 62 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
ATAL
2006
Springer
15 years 5 months ago
ACTIVE: agile coordinator testbed integrated virtual environment
This paper describes the specification, design and development of ACTIVE, a testbed for the testing and simulation of large-scale agent-based systems. ACTIVE is being developed as...
G. Emami, J. Cheng, D. Cornwell, M. Feldhousen, C....
ATAL
2008
Springer
15 years 3 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
203
Voted

Book
357views
16 years 11 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
ECRTS
2005
IEEE
15 years 7 months ago
Task Assignment on Uniform Heterogeneous Multiprocessors
The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is a...
Shelby Funk, Sanjoy K. Baruah
105
Voted
PUK
2001
15 years 3 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber