Sciweavers

6976 search results - page 69 / 1396
» The Oil Searching Problem
Sort
View
163
Voted
ATMOS
2010
162views Optimization» more  ATMOS 2010»
15 years 3 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
AAAI
2004
15 years 6 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 23 days ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
ICTAI
1999
IEEE
15 years 9 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
230
Voted
CP
2009
Springer
16 years 5 months ago
Search Spaces for Min-Perturbation Repair
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
Alex S. Fukunaga