287 search results - page 32 / 58 » On the Power of Randomization in Algorithmic Mechanism Desig... |
MASCOTS
2007
15 years 3 months ago
2007
—One of the biggest bottlenecks in desktop-based computing is the hard disk with I/O write latency being a key contributor. I/O write latency stems from the mechanical nature of ...
126
click to vote
AINA
2005
IEEE
15 years 7 months ago
2005
IEEE
The Location of nodes in sensor network is an important problem with application in resource allocation, location sensitive browsing, and emergency communications. A key problem i...
118
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
118
click to vote
PIMRC
2010
IEEE
14 years 12 months ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
117
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...