Sciweavers

1589 search results - page 121 / 318
» Multiple-Goal Heuristic Search
Sort
View
124
Voted
TODAES
2008
160views more  TODAES 2008»
15 years 3 months ago
A new efficient retiming algorithm derived by formal manipulation
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...
Hai Zhou
102
Voted
SCHEDULING
2010
57views more  SCHEDULING 2010»
14 years 10 months ago
Scheduling technicians and tasks in a telecommunications company
This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunicatio...
Jean-François Cordeau, Gilbert Laporte, Fed...
150
Voted
GIS
2010
ACM
15 years 2 months ago
Location disambiguation in local searches using gradient boosted decision trees
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...
Ritesh Agrawal, James G. Shanahan
131
Voted
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 4 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
104
Voted
ECP
1997
Springer
103views Robotics» more  ECP 1997»
15 years 7 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler