Sciweavers

10870 search results - page 2144 / 2174
» Model Checking Programs
Sort
View
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
13 years 12 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
13 years 12 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
ISER
1993
Springer
123views Robotics» more  ISER 1993»
13 years 11 months ago
Mobile Robot Miniaturisation: A Tool for Investigation in Control Algorithms
The interaction of an autonomous mobile robot with the real world critically depends on the robots morphology and on its environment. Building a model of these aspects is extremel...
Francesco Mondada, Edoardo Franzi, Paolo Ienne
SIGGRAPH
1993
ACM
13 years 11 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
« Prev « First page 2144 / 2174 Last » Next »