Sciweavers

2457 search results - page 301 / 492
» Local Search with Bootstrapping
Sort
View
ATAL
2010
Springer
15 years 5 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
CEC
2010
IEEE
15 years 4 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...
SIGIR
2010
ACM
15 years 4 months ago
Scalability of findability: effective and efficient IR operations in large information networks
It is crucial to study basic principles that support adaptive and scalable retrieval functions in large networked environments such as the Web, where information is distributed am...
Weimao Ke, Javed Mostafa
WWW
2010
ACM
15 years 4 months ago
SNDocRank: document ranking based on social networks
To improve the search results for socially-connect users, we propose a ranking framework, Social Network Document Rank (SNDocRank). This framework considers both document contents...
Liang Gou, Hung-Hsuan Chen, Jung-Hyun Kim, Xiaolon...
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 4 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....