224 search results - page 36 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
125
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
133
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
122
Voted
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
109
Voted
DAC
2010
ACM
15 years 7 months ago
2010
ACM
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
148
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Search engines that support structured documents typically support structure created by the author (e.g., title, section), and may also support structure added by an annotation pr...