Sciweavers

1639 search results - page 125 / 328
» Anytime Heuristic Search
Sort
View
CCCG
2001
13 years 11 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
TODAES
2008
160views more  TODAES 2008»
13 years 10 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
SCHEDULING
2010
57views more  SCHEDULING 2010»
13 years 5 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
13 years 8 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»
13 years 11 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...