3875 search results - page 541 / 775 » Approximation algorithms for the 0-extension problem |
141
Voted
COMPGEOM
2006
ACM
16 years 17 days ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
189
click to vote
ECML
2005
Springer
16 years 4 days ago
2005
Springer
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
175
click to vote
ICDCN
2009
Springer
15 years 11 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
157
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric al...
185
click to vote
ESANN
2008
15 years 8 months ago
2008
Using multilayer perceptrons (MLPs) to approximate the state-action value function in reinforcement learning (RL) algorithms could become a nightmare due to the constant possibilit...