5316 search results - page 65 / 1064 » Which Search Problems Are Random |
123
click to vote
FLAIRS
2007
15 years 3 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
76
Voted
ICEC
1994
15 years 2 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
132
click to vote
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
102
click to vote
AISS
2010
14 years 10 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
119
click to vote
GCC
2003
Springer
15 years 6 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...