5316 search results - page 60 / 1064 » Which Search Problems Are Random |
87
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
99
Voted
INFORMATICALT
2002
15 years 14 days ago
2002
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
111
click to vote
KR
2004
Springer
15 years 6 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
112
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
113
Voted
OR
2005
Springer
15 years 6 months ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...