5 search results - page 1 / 1 » Phase Transitions for Weakly Increasing Sequences |
CIE
2008
Springer
14 years 26 days ago
2008
Springer
JAIR
1998
13 years 10 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
ALGORITHMICA
2007
13 years 11 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
CAV
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. We present a novel static analysis technique that substantially improves the quality of invariants inferred by standard loop invariant generation techniques. Our techniqu...
VLSID
2005
IEEE
14 years 11 months ago
2005
IEEE
Interest in asynchronous circuit design is increasing due to its promise of efficient designs. The quiescent nature of asynchronous circuits allows them to remain in a stable stat...