Sciweavers

96 search results - page 8 / 20
» Variable Ordering Heuristics Show Promise
Sort
View
DATE
2000
IEEE
88views Hardware» more  DATE 2000»
14 years 3 months ago
Free MDD-Based Software Optimization Techniques for Embedded Systems
Embedded systems make a heavy use of software to perform Real-Time embedded control tasks. Embedded software is characterized by a relatively long lifetime and by tight cost, perf...
Chunghee Kim, Luciano Lavagno, Alberto L. Sangiova...
CPAIOR
2004
Springer
14 years 4 months ago
Models and Symmetry Breaking for 'Peaceable Armies of Queens'
We discuss a di cult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the b...
Barbara M. Smith, Karen E. Petrie, Ian P. Gent
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 11 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CPAIOR
2006
Springer
14 years 2 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu
TEC
2002
163views more  TEC 2002»
13 years 10 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon