Sciweavers

881 search results - page 34 / 177
» Solving satisfiability problems with preferences
Sort
View
AISC
2008
Springer
13 years 10 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
GECCO
2010
Springer
244views Optimization» more  GECCO 2010»
13 years 8 months ago
Implicit fitness and heterogeneous preferences in the genetic algorithm
This paper takes an economic approach to derive an evolutionary learning model based entirely on the endogenous employment of genetic operators in the service of self-interested a...
Justin T. H. Smith
JUCS
2006
102views more  JUCS 2006»
13 years 8 months ago
A Mechanism for Solving Conflicts in Ambient Intelligent Environments
: Ambient Intelligence scenarios describe situations in which multitude of devices and agents live together. In this kind ofscenarios is frequent to see the appearance ofconflicts ...
Pablo A. Haya, Germán Montoro, Abraham Esqu...
EOR
2007
101views more  EOR 2007»
13 years 8 months ago
Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms
Heavy industry maintenance facilities at aircraft service centers or railroad yards must contend with scheduling preventive maintenance tasks to ensure critical equipment remains ...
Gang Quan, Garrison W. Greenwood, Donglin Liu, Xia...
AI
2005
Springer
13 years 8 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf