Sciweavers

439 search results - page 47 / 88
» Neighborhood Structures for GPU-Based Local Search Algorithm...
Sort
View
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 8 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
ATAL
2010
Springer
13 years 10 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
MM
2004
ACM
99views Multimedia» more  MM 2004»
14 years 2 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
13 years 10 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
ATAL
2010
Springer
13 years 10 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish