674 search results - page 65 / 135 » The computational complexity of the parallel knock-out probl... |
102
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
114
click to vote
SCP
1998
15 years 1 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
140
click to vote
ICDCS
2010
IEEE
14 years 11 months ago
2010
IEEE
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
112
click to vote
DAGSTUHL
2006
15 years 2 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
110
click to vote
PPSN
1992
Springer
15 years 5 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...