Sciweavers

8094 search results - page 57 / 1619
» Improvements in Formula Generalization
Sort
View
DAC
2007
ACM
14 years 10 months ago
Alembic: An Efficient Algorithm for CNF Preprocessing
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
HyoJung Han, Fabio Somenzi
ECAI
2006
Springer
14 years 20 days ago
Unified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
Jussi Rintanen
JSC
2011
100views more  JSC 2011»
12 years 12 months ago
Toric forms of elliptic curves and their arithmetic
We scan a large class of one-parameter families of elliptic curves for efficient arithmetic. The construction of the class is inspired by toric geometry, which provides a natural ...
Wouter Castryck, Frederik Vercauteren
ISPD
2003
ACM
133views Hardware» more  ISPD 2003»
14 years 2 months ago
Closed form expressions for extending step delay and slew metrics to ramp inputs
: Recent years have seen significant research in finding closed form expressions for the delay of an RC circuit that improves upon the Elmore delay model. However, several of these...
Chandramouli V. Kashyap, Charles J. Alpert, Frank ...
ECCC
2010
108views more  ECCC 2010»
13 years 6 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...