12950 search results - page 561 / 2590 » On Optimal Timed Strategies |
190
Voted
ASPDAC
2004
ACM
16 years 21 days ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
183
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
190
Voted
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
223
click to vote
SPAA
1993
ACM
15 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
184
click to vote
CAAN
2006
Springer
15 years 11 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...