Sciweavers

514 search results - page 2 / 103
» On enumerating all minimal solutions of feedback problems
Sort
View
CPAIOR
2009
Springer
14 years 5 days ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
DAC
2005
ACM
13 years 7 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
ESA
2009
Springer
115views Algorithms» more  ESA 2009»
14 years 5 days ago
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 5 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
CHI
2010
ACM
14 years 13 days ago
One size does not fit all: applying the transtheoretical model to energy feedback technology design
Global warming, and the climate change it induces, is an urgent global issue. One remedy to this problem, and the focus of this paper, is to motivate sustainable energy usage beha...
Helen Ai He, Saul Greenberg, Elaine M. Huang