1370 search results - page 234 / 274 » On grids in topological graphs |
PODC
2009
ACM
15 years 6 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
107
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
138
click to vote
FUN
2010
Springer
15 years 3 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
100
click to vote
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
110
click to vote
AI
2010
Springer
14 years 12 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...