Sciweavers

5372 search results - page 335 / 1075
» complexity 2007
Sort
View
127
Voted
HEURISTICS
2007
103views more  HEURISTICS 2007»
15 years 2 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen
122
Voted
HEURISTICS
2007
139views more  HEURISTICS 2007»
15 years 2 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
IJFCS
2007
109views more  IJFCS 2007»
15 years 2 months ago
Computational Power of intramolecular gene Assembly
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organism. Three molecular operations...
Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogojin
65
Voted
IPL
2007
50views more  IPL 2007»
15 years 2 months ago
Wait-free regular storage from Byzantine components
We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
JAIR
2007
127views more  JAIR 2007»
15 years 2 months ago
Learning Symbolic Models of Stochastic Domains
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
Hanna M. Pasula, Luke S. Zettlemoyer, Leslie Pack ...