738 search results - page 8 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
77
Voted
ECCE
2007
14 years 11 months ago
2007
Motivation – This paper is based on a research project which examines the way car drivers and automated devices cooperate to achieve lateral control of a vehicle. A theoretical ...
JCM
2007
14 years 9 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
DAC
1998
ACM
15 years 10 months ago
1998
ACM
Abstract-Our strategy for automatic generation of functional vectors is based on exercising selected paths in the given hardware description language (HDL) model. The HDL model des...
BTW
2007
Springer
15 years 3 months ago
2007
Springer
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
CHES
2008
Springer
14 years 11 months ago
2008
Springer
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosyst...