8413 search results - page 23 / 1683 » Ordering Problem Subgoals |
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
DEXA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
FGCS
2000
13 years 7 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
EVOW
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
CEC
2008
IEEE
13 years 10 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...