Sciweavers

14386 search results - page 269 / 2878
» The Chinese Generals Problem
Sort
View
LICS
2006
IEEE
15 years 11 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
DOCENG
2006
ACM
15 years 10 months ago
Solving the simple continuous table layout problem
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
Nathan Hurst, Kim Marriott, David W. Albrecht
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 10 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
VLSM
2005
Springer
15 years 10 months ago
A Gradient Descent Procedure for Variational Dynamic Surface Problems with Constraints
Abstract. Many problems in image analysis and computer vision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and...
Jan Erik Solem, Niels Chr. Overgaard
121
Voted
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 10 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner