388 search results - page 46 / 78 » An approximate algorithm for median graph computation using ... |
138
click to vote
WDAG
2007
Springer
15 years 9 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
142
click to vote
CODES
2001
IEEE
15 years 6 months ago
2001
IEEE
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
149
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
145
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
111
click to vote
ICNP
2005
IEEE
15 years 8 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...