3875 search results - page 329 / 775 » Approximation algorithms for the 0-extension problem |
170
click to vote
APPROX
2004
Springer
16 years 6 days ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
167
click to vote
DCG
2008
15 years 6 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
183
click to vote
IWANN
1999
Springer
15 years 11 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
288
click to vote
VLDB
2005
ACM
16 years 7 months ago
2005
ACM
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
242
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...