193 search results - page 25 / 39 » A Lower Bound for the Shortest Path Problem |
152
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
144
click to vote
IPCO
2007
15 years 5 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
131
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
138
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
180
click to vote
DIALM
2003
ACM
15 years 9 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...