5115 search results - page 728 / 1023 » On Randomized Lanczos Algorithms |
169
click to vote
TACAS
2000
Springer
15 years 10 months ago
2000
Springer
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
166
click to vote
ISTCS
1995
Springer
15 years 10 months ago
1995
Springer
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
151
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
158
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
174
click to vote
AAAI
2004
15 years 8 months ago
2004
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...