2543 search results - page 351 / 509 » Optimal Ordered Problem Solver |
124
Voted
AIPS
2007
15 years 3 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
122
click to vote
IJCAI
2001
15 years 2 months ago
2001
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
125
Voted
AIPS
2009
15 years 1 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
108
Voted
FGCS
2008
15 years 22 days ago
2008
Data is typically replicated in a Data Grid to improve the job response time and data availability. Strategies for data replication in a Data Grid have previously been proposed, b...
157
Voted
IJCV
2006
15 years 20 days ago
2006
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...