243 search results - page 33 / 49 » Parallel and distributed algorithms for finite constraint sa... |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
ICDCS
1992
IEEE
13 years 11 months ago
1992
IEEE
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework inco...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
GECCO
2004
Springer
14 years 27 days ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...