Sciweavers

4377 search results - page 579 / 876
» Mass problems and randomness
Sort
View
ATAL
2006
Springer
15 years 10 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 10 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
EMO
2006
Springer
113views Optimization» more  EMO 2006»
15 years 10 months ago
Prediction-Based Population Re-initialization for Evolutionary Dynamic Multi-objective Optimization
Abstract. Optimization in changing environment is a challenging task, especially when multiple objectives are to be optimized simultaneously. The basic idea to address dynamic opti...
Aimin Zhou, Yaochu Jin, Qingfu Zhang, Bernhard Sen...
CVPR
2010
IEEE
15 years 8 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 8 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller