6976 search results - page 128 / 1396 » The Oil Searching Problem |
156
click to vote
ICTAI
2006
IEEE
16 years 13 days ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
160
click to vote
CONIELECOMP
2005
IEEE
16 years 1 days ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
157
click to vote
AAAI
2000
15 years 7 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
172
click to vote
IJCNN
2006
IEEE
16 years 13 days ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
179
click to vote
WSC
1998
15 years 7 months ago
1998
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...