332 search results - page 27 / 67 » A Direct Algorithm for Multi-valued Bounded Model Checking |
OPODIS
2004
15 years 2 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
113
click to vote
TCAD
2008
15 years 1 months ago
2008
The quality and the correctness of software is often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific...
121
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
122
click to vote
FOCS
1990
IEEE
15 years 5 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
119
click to vote
ISPD
2003
ACM
15 years 6 months ago
2003
ACM
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first ...