Sciweavers

504 search results - page 11 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
COCO
2003
Springer
102views Algorithms» more  COCO 2003»
14 years 3 months ago
Memoization and DPLL: Formula Caching Proof Systems
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...
DALT
2009
Springer
14 years 1 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
14 years 3 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
RANDOM
2001
Springer
14 years 2 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
AVI
2008
14 years 4 days ago
Agent warp engine: formula based shape warping for networked applications
Computer visualization and networking have advanced dramatically over the last few years, partially driven by the exploding video game market. 3D hardware acceleration has reached...
Alexander Repenning, Andri Ioannidou