Sciweavers

2412 search results - page 200 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
132
Voted
CCCG
2007
15 years 5 months ago
Covering Points by Isothetic Unit Squares
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
116
Voted
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 4 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
137
Voted
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
15 years 5 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
175
Voted
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
15 years 1 months ago
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-Like Exploration
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
Tobias Jung, Peter Stone
177
Voted
CP
2003
Springer
15 years 9 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...