a model for the heuristic selection in the case of the resolution of partial ... we present the resource sharing problem as defined in [18]. In Section III, we introduce ...
al 86, Korf 85, Langley 85, Mitchell et al 83). An ... as in [Iba 85], [Korf 85]) and [Dawson & Siklossy 77]. ... a space of goal nodes (similar to those in [Dawson &.
Nov 26, 2008 - ABSTRACT. The main text content of an HTML document on the WWW .... in [8] that it is possible to convert any TD algorithm into a single document CE ..... XHTML content from navigation clutter using. DOM-structure block ...
approach to generate a combinatorial interaction test suites in the pres- ..... bitrary formulas containing uninterpreted function symbols with equality, linear.
Jun 27, 2014 - application for comparison of cost estimation between traditional loop ...... using the software VISUM with a model of Lisbon's network and an OD ...... In order to estimate different categories of traffic status, we applied a transfer
Nov 20, 2004 ... http://www.openoffice.org/licenses/PDL.rtf ... [email protected]. ...
For example, you can rotate a group of objects in its entirety.
The aim of heuristic methods for COPs is to quickly produce good-quality ... The MKP can be formulated as follows: â. = n j jj xp. 1 max. â. = = ⤠n j i j ij m ic xr.
the sense of a source word and select the most appropriate one among various .... 'car' is translated into a Korean word 'cha', which has two different meanings ...
as Jadex[15] and JACK[17] have taken a much more pragmatic road and use ... gramming languages to commit a programmer to learn a new and specific knowl ...
vehicles which are only available within certain time windows at each period. Our goal is to ... house through a fleet of vehicles. Under supply chain .... such as the works of Federgruen and Zipkin (1984), Golden, Assad, and Dahl (1984), Chien ...
Demokritos, Athens, Greece. Lorrie F. Cranor and Brian A. LaMacchia. 1998. Spam! Comm. of ... Morgan Kaufmann. Yiming Yang. 1999. An evaluation of statisti-.
formed traditionally using heuristics from the domain. ... machine learning algorithms applied to spam fil- tering ... phrases (like "free money"); some non text .... see that this information alone is not competi- ... Infor- mation Retrieval, 1(1-2)
Simple Heuristics. That Make. US Smart. Gerd Gigerenzer. Peter M. Todd and the ABC Research Group. New York Oxford. Oxford University Press. 1999 ...
over the 3MB size limitation, then try using the Smaller File Size setting. 6. Click
Next ... Select “Merge Files into a Single PDF” and then click Create. 8. Review ...
(2002) performance measures due to the use large number performance indicators. It also added ... BSC and performance prism at the stage of outlining the strategy map of ... critics in late 1970s and early 1980s on traditional finance based ...
Ying Wang, Weiru Liu, and David Bell. School of Electronics, Electrical Engineering and Computer Science,. Queen's University Belfast, Belfast, BT7 1NN, UK.
add it to the list, or use the [Ctrl]-click combination to select multiple files in the
same ... command, or by using the Create PDF > From Multiple Files command.
Dec 2, 2015 - In recent years, market growth in smartphones is slow and becom- ing more ... watch that is compatible with Apple's iOS, Google's Android, and.
Columbia, Vancouver, Canada) (11) ... University of British Columbia, St. Paul's Hospital, Vancouver, BC, Canada ..... Centre at Vancouver General Hospital.
Feb 28, 1999 - fortunately, this is not true: As, for example, Lance Spitzner writes in his book [Spi02]:. âOn February ..... Addison Wesley, 2001. [PYD]. Samuel ...
Stephen F. Smith2. Computer Science Department1 and ..... Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. SATzilla2007: a new & improved ...
This paper proposes a vision-based pedestrian detection in crowded situations based on a single camera. .... plates [5]. The method to construct templates for match- ing is the same as our previous work [6]. Let { } T. N ii. T 1 .... The OpenCV li-.
{sshanli,cqzong}@nlpr.ia.ac.cn. Xia Wang ... ent classifiers are generated through train- ing the review data ... fier with the best-performance feature set for the final decision. ..... Natural Language Processing, Sydney, AUS: Asso- ciation for ...
Dec 2, 2015 - information with smart phones, and conduct real-time monitoring of physical condition. ... watch that is compatible with Apple's iOS, Google's Android, and ... product(s) for sale, in which a firm could employ it to accomplish the.
Can often reduce average-case run time by running several heuristics in parallel (on a single processor) 3
This talk
• Goal: interleave the execution of multiple
heuristics in order to improve average-case running time
• Schedule for interleaving can be learned
online while solving a sequence of problems
4
Related work •
•
Algorithm portfolios
•
Assign each heuristic a fixed proportion of CPU time, plus a fixed restart threshold (Huberman et al. 1997, Gomes et al. 2001)
•
Later work used instance features to predict which heuristic will finish first (e.g., Leyton-Brown et al. 2003, Xu et al. 2007)
Combining Multiple Heuristics (Sayag et al. 2006)
•
considered resource-sharing schedules and task-switching schedules
•
gave offline algorithms + bounds for PAC learning; algorithms are exponential in #heuristics 5
Formal setup • •
Given: k heuristics, n decision problems to solve
• •
For each i, assume minj τij ≤ B
Using jth heuristic to solve ith instance takes time τij, where τij {1, 2, ..., B} {∞}
Solve each problem by interleaving execution of heuristics according to a task-switching schedule
6
Task-switching schedules •
Mapping S from integer time slices to heuristics; S(t) = heuristic to run from time t to time t+1
•
Example:
h1 ...
h2 h3 time
7
Task-switching schedules •
Mapping S from integer time slices to heuristics; S(t) = heuristic to run from time t to time t+1
•
Example:
h1
Completion times
...
h2
h1 h2 h3 I1
h3 time
7
2
7
7
Task-switching schedules •
Mapping S from integer time slices to heuristics; S(t) = heuristic to run from time t to time t+1
•
Example:
h1
Completion times
...
h2
h1 h2 h3 I1
h3
2
time
•
Can also handle model where we throw away all work when switching between heuristics 7
7
7
Three settings • ☆
☆
We consider selecting task-switching schedules in three settings:
•
Offline: given table τ as input, compute an optimal schedule
•
Learning-theoretic: PAC-learn an optimal restart schedule from training instances
•
Online: you are fed an arbitrary sequence of instances one at a time, and must solve each instance before moving on to the next
8
The offline setting
• Offline problem: given table τ of completion
times, compute task-switching schedule that minimizes sum of CPU time over all instances
• Think τ of as training data
9
Offline shortest path algorithm end
•
Can think of a taskswitching schedule as a path in a kdimensional grid with sides of length B+1 h2 (here B=4)
4 3 2 1 0
start
0
1
2
h1 10
3
4
Offline shortest path algorithm end
•
•
Can think of a taskswitching schedule as a path in a kdimensional grid with sides of length B+1 h2 (here B=4) E.g. “run h1 for 2 seconds, then run h2 for 3 seconds...”
4 3 2 1 0
start
0
1
2
h1 10
3
4
Offline shortest path algorithm Completion times h1
Shortest path problem
h2
4
I1 I2 I3 I4
3
h2
2 1 0
start
0
1
2
h1 11
3
4
end
Offline shortest path algorithm Completion times h1
Shortest path problem
h2
4
I1 I2 I3 I4
3
h2
2 1 0
start
0
1
2
h1 11
3
4
end
Offline shortest path algorithm Completion times
I1 I2 I3 I4
h1
h2
3
4
Shortest path problem
h2
4
0
0
0
0
0
3
1
1
1
0
0
2
1
1
1
0
0
1
1
1
1
0
0
0
1
1
1
0
0
0
1
2
3
4
start
h1 11
end
Offline shortest path algorithm Completion times h1
h2
I1
3
4
I2
2
1
I3 I4
Shortest path problem
h2
4
0
0
0
0
0
3
1
1
1
0
0
2
1
1
1
0
0
1
1
1
1
0
0
0
2
2
1
0
0
0
1
2
3
4
start
h1 11
end
Offline shortest path algorithm Completion times h1
h2
I1
3
4
I2
2
1
I3 I4
2
4
Shortest path problem
h2
4
0
0
0
0
0
3
2
2
1
0
0
2
2
2
1
0
0
1
2
2
1
0
0
0
3
3
1
0
0
0
1
2
3
4
start
h1 11
end
Offline shortest path algorithm Completion times h1
h2
I1
3
4
I2
2
1
I3
2
4
I4
3
1
Shortest path problem
h2
4
0
0
0
0
0
3
2
2
1
0
0
2
2
2
1
0
0
1
2
2
1
0
0
0
4
4
2
0
0
0
1
2
3
4
start
h1 11
end
Offline shortest path algorithm Completion times h1
h2
I1
3
4
I2
2
1
I3
2
4
I4
3
1
Shortest path problem
h2
4
0
0
0
0
0
3
2
2
1
0
0
2
2
2
1
0
0
1
2
2
1
0
0
0
4
4
2
0
0
0
1
2
3
4
start
h1 11
end
Offline shortest path algorithm Shortest path problem
•
Time complexity is O(nk(B+1)k) h2
4
0
0
0
0
0
3
2
2
1
0
0
2
2
2
1
0
0
1
2
2
1
0
0
0
4
4
2
0
0
0
1
2
3
4
start
h1 11
end
Offline shortest path algorithm Shortest path problem
•
Time complexity is O(nk(B+1)k)
•
h2 Can get αapproximation in time O(nk(1+logα B)k)
4
0
0
0
0
0
3
2
2
1
0
0
2
2
2
1
0
0
1
2
2
1
0
0
0
4
4
2
0
0
0
1
2
3
4
start
h1 11
end
Greedy approximation algorithm
12
Greedy approximation algorithm •
How hard is it to compute optimal task-switching schedule?
•
•
Special case B=1 is MIN-SUM SET COVER. NP-hard to get 4-ε approx for any ε>0 (Feige, Lovász, & Tetali 2002)
Greedy alg. for MIN-SUM SET COVER gives 4-approx. We generalize to get 4-approx for task-switching schedules
12
Greedy approximation algorithm •
How hard is it to compute optimal task-switching schedule?
•
Special case B=1 is MIN-SUM SET COVER. NP-hard to get 4-ε approx for any ε>0 (Feige, Lovász, & Tetali 2002)
•
Greedy alg. for MIN-SUM SET COVER gives 4-approx. We generalize to get 4-approx for task-switching schedules
•
Algorithm: greedily pick pair (h,t) such that running heuristic h for t (additional) time steps maximizes #(new instances solved)/t (append (h,t) to schedule and repeat) 12
The online setting • • • •
World secretly selects sequence of n instances For i from 1 to n
• •
You select schedule Si to use to solve ith instance As feedback you observe how much time Si takes
regret = E[your total time] - min(schedules S) (S’s total time) Want worst-case regret that is o(n)
13
Online algorithms
14
Online algorithms •
We give a strategy whose worst-case regret is O(Bkn2/3(Bk log k)1/3) = o(n)
•
combines online shortest path algorithm of György et al. (2006) with technique from Cesa-Bianchi et al. (2005)
•
total decision-making time is comparable to running offline shortest path alg.
14
Online algorithms •
•
We give a strategy whose worst-case regret is O(Bkn2/3(Bk log k)1/3) = o(n)
•
combines online shortest path algorithm of György et al. (2006) with technique from Cesa-Bianchi et al. (2005)
•
total decision-making time is comparable to running offline shortest path alg.
Ongoing work: online version of greedy approximation algorithm
14
Experimental Evaluation •
•
Various conferences hold annual solver competitions
•
each submitted solver is run on a sequence of instances (subject to time limit)
•
awards for solvers that solve the most instances in various instance categories
We downloaded tables of completion times, used them to run our offline algorithms
