1603 search results - page 86 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
154
click to vote
EOR
2007
15 years 6 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
167
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
184
click to vote
NIPS
2004
15 years 7 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
172
click to vote
EUROGP
2005
Springer
15 years 12 months ago
2005
Springer
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
181
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...