3875 search results - page 360 / 775 » Approximation algorithms for the 0-extension problem |
199
click to vote
IPCO
2007
15 years 8 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
204
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
184
click to vote
ESA
2005
Springer
16 years 11 days ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
184
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
170
click to vote
RTSS
1999
IEEE
15 years 11 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...