4488 search results - page 48 / 898 » Focusing Search by Using Problem Solving Experience |
129
Voted
CP
2001
Springer
15 years 7 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
122
Voted
EWCBR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The Web is a vibrant environment for innovation in computer science, AI, and social interaction; these innovations come in such great number and speed that it is unlikely...
124
Voted
HICSS
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
137
Voted
DPD
1998
15 years 2 months ago
1998
To meet users’ growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recen...
123
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...