Sciweavers

510 search results - page 30 / 102
» How Should We Solve Search Problems Privately
Sort
View
CEC
2008
IEEE
14 years 2 months ago
An investigation on evolutionary gradient search for multi-objective optimization
—Evolutionary gradient search is a hybrid algorithm that exploits the complementary features of gradient search and evolutionary algorithm to achieve a level of efficiency and r...
Chi Keong Goh, Yew-Soon Ong, Kay Chen Tan, Eu Jin ...
IJCAI
2007
13 years 9 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
PADL
2004
Springer
14 years 27 days ago
Pruning in the Extended Andorra Model
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
Ricardo Lopes, Vítor Santos Costa, Fernando...
ATAL
2010
Springer
13 years 8 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