Sciweavers

5595 search results - page 776 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
VTC
2006
IEEE
118views Communications» more  VTC 2006»
16 years 23 days ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu
145
Voted
COMPGEOM
2006
ACM
16 years 22 days ago
Minimum-cost load-balancing partitions
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...
Boris Aronov, Paz Carmi, Matthew J. Katz
ECML
2005
Springer
16 years 8 days ago
Fitting the Smallest Enclosing Bregman Ball
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...
Richard Nock, Frank Nielsen
DAGSTUHL
2008
15 years 8 months ago
Theory of Real Computation According to EGC
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...
Chee-Keng Yap
ESANN
2008
15 years 8 months ago
Multilayer Perceptrons with Radial Basis Functions as Value Functions in Reinforcement Learning
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...
Victor Uc Cetina