4488 search results - page 165 / 898 » Focusing Search by Using Problem Solving Experience |
128
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
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...
123
Voted
ICIW
2009
IEEE
15 years 10 months ago
2009
IEEE
— Personalized Web Search becomes nowadays a promising option in the field of Information Retrieval and search engines design by improving both output quality and user experience...
112
Voted
COR
2006
15 years 3 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
122
click to vote
ANOR
2007
15 years 3 months ago
2007
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
127
Voted
DCC
2002
IEEE
16 years 3 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...