244 search results - page 1 / 49 » A Linear Search Strategy using Bounds |
AIPS
2004
13 years 6 months ago
2004
CP
2006
Springer
13 years 8 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
P2P
2007
IEEE
13 years 11 months ago
2007
IEEE
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...
KES
2004
Springer
13 years 10 months ago
2004
Springer
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...