3820 search results - page 408 / 764 » Bounded Model Debugging |
171
Voted
SAT
2004
Springer
16 years 3 days ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
191
click to vote
FOCS
2003
IEEE
16 years 1 days ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
147
click to vote
CAV
2003
Springer
15 years 12 months ago
2003
Springer
We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path that is finite, but not necessarily maximal. Truncated paths arise n...
142
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
189
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...