44 search results - page 3 / 9 » On Solving Boolean Optimization with Satisfiability-Based Al... |
110
click to vote
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The proliferation of all kinds of devices with different security requirements and constraints, and the arms-race nature of the security problem are increasingly demanding the de...
DATE
2008
IEEE
15 years 1 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
103
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...