17967 search results - page 3543 / 3594 » Functional timing optimization |
84
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
91
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
COCOON
2010
Springer
15 years 3 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
105
Voted
FUN
2010
Springer
15 years 3 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
83
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...