Sciweavers

3928 search results - page 231 / 786
» Optimal suffix selection
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
CVPR
2007
IEEE
16 years 8 months ago
Linear and Quadratic Subsets for Template-Based Tracking
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
Selim Benhimane, Alexander Ladikos, Vincent Lepeti...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
16 years 21 days ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
KDD
2000
ACM
142views Data Mining» more  KDD 2000»
15 years 10 months ago
Automating exploratory data analysis for efficient data mining
Having access to large data sets for the purpose of predictive data mining does not guarantee good models, even when the size of the training data is virtually unlimited. Instead,...
Jonathan D. Becher, Pavel Berkhin, Edmund Freeman
TREC
2008
15 years 8 months ago
Where to Stop Reading a Ranked List?
: We document our participation in the TREC 2008 Legal Track. This year we focused solely on selecting rank cut-offs for optimizing the given evaluation measure per topic.
Avi Arampatzis, Jaap Kamps