344 search results - page 47 / 69 » A constant factor approximation algorithm for a class of cla... |
153
click to vote
SPAA
1999
ACM
15 years 6 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
136
Voted
ML
2002
ACM
15 years 2 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
315
Voted
COCOON
2011
Springer
14 years 2 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
132
click to vote
ICCV
1999
IEEE
16 years 4 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
98
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...