Sciweavers

1614 search results - page 121 / 323
» Breadth-First Heuristic Search
Sort
View
SCHEDULING
2010
57views more  SCHEDULING 2010»
14 years 11 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...
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
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 5 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...
ECP
1997
Springer
103views Robotics» more  ECP 1997»
15 years 8 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
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 9 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt