Sciweavers

160 search results - page 28 / 32
» Satisfiability-Based Algorithms for Boolean Optimization
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 8 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák
ACSC
2006
IEEE
15 years 4 months ago
Pruning subscriptions in distributed publish/subscribe systems
Publish/subscribe systems utilize filter algorithms to determine all subscriptions matching incoming event messages. To distribute such services, subscriptions are forwarded to s...
Sven Bittner, Annika Hinze
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 2 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
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...
Jean-Baptiste Mouret, Stéphane Doncieux
VLSID
2007
IEEE
153views VLSI» more  VLSID 2007»
15 years 10 months ago
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
Zhaohui Fu, Sharad Malik
SARA
2009
Springer
15 years 4 months ago
Automated Redesign with the General Redesign Engine
: Given a system design (SD), a key task is to optimize this design to reduce the probability of catastrophic failures. We consider the task of redesigning an SD to minimize the pr...
Alexander Feldman, Gregory M. Provan, Johan de Kle...