Sciweavers

1884 search results - page 294 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
DAC
2008
ACM
15 years 11 months ago
Automated transistor sizing for FPGA architecture exploration
The creation of an FPGA requires extensive transistor-level design. This is necessary for both the final design, and during architecture exploration, when many different logic and...
Ian Kuon, Jonathan Rose
MICCAI
2003
Springer
15 years 11 months ago
Mesh Topology Identification for Mass-Spring Models
In surgical simulations, the two most popular approaches to model soft tissues are Finite Element Method (FEM) and Mass-Spring System (MSS). Main advantages of FEM are accuracy and...
Gábor Székely, Gérald Bianchi...
RECOMB
2008
Springer
15 years 10 months ago
Hurdles Hardly Have to Be Heeded
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard...
CADE
2006
Springer
15 years 10 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
85
Voted
CADE
2002
Springer
15 years 10 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg