Sciweavers

2635 search results - page 283 / 527
» Computing multihomogeneous resultants using straight-line pr...
Sort
View
ICALP
2007
Springer
14 years 4 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
3DPVT
2006
IEEE
233views Visualization» more  3DPVT 2006»
14 years 4 months ago
Scanline Optimization for Stereo on Graphics Hardware
In this work we propose a scanline optimization procedure for computational stereo using a linear smoothness cost model performed by programmable graphics hardware. The main idea ...
Christopher Zach, Mario Sormann, Konrad F. Karner
SPIN
2004
Springer
14 years 4 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
FPL
2003
Springer
95views Hardware» more  FPL 2003»
14 years 4 months ago
Reconfigurable Hardware SAT Solvers: A Survey of Systems
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
Iouliia Skliarova, António de Brito Ferrari
SPIN
2010
Springer
13 years 9 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...