3352 search results - page 83 / 671 » Hierarchical Problem Solving and the Bayesian Optimization A... |
125
Voted
EURODAC
1994
IEEE
15 years 9 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
160
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
144
click to vote
ATMOS
2008
15 years 6 months ago
2008
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
103
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
162
click to vote
UAI
1998
15 years 6 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...