475 search results - page 4 / 95 » Feasible distributed CSP models for scheduling problems |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we consider the problem of managing and exploiting schedules in an uncertain and distributed environment. We assume a team of collaborative agents, each responsible ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
AIPS
2006
13 years 8 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
SBACPAD
2003
IEEE
14 years 22 days ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...