674 search results - page 98 / 135 » The computational complexity of the parallel knock-out probl... |
121
click to vote
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
CCGRID
2009
IEEE
15 years 8 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
119
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
133
click to vote
CASES
2007
ACM
15 years 5 months ago
2007
ACM
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
126
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...