5316 search results - page 224 / 1064 » Which Search Problems Are Random |
103
click to vote
AUSAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
141
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
224
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
109
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
115
click to vote
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...