2488 search results - page 75 / 498 » Distributed Non-binary Constraints |
100
click to vote
CISSE
2009
Springer
15 years 4 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
146
Voted
CORR
2007
Springer
15 years 17 days ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
88
Voted
SOFSEM
2004
Springer
15 years 6 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
107
Voted
HPDC
2010
IEEE
15 years 1 months ago
2010
IEEE
The recent emergence of clouds is making the vision of utility computing realizable, i.e. computing resources and services can be delivered, utilized, and paid for as utilities su...
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...