Sciweavers

1291 search results - page 89 / 259
» Arithmetic program paths
Sort
View
106
Voted
LPAR
2005
Springer
15 years 6 months ago
Towards Automated Proof Support for Probabilistic Distributed Systems
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
Annabelle McIver, Tjark Weber
92
Voted
ICALP
2010
Springer
15 years 5 months ago
Mean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
Albert Atserias, Elitza N. Maneva
HICSS
1995
IEEE
109views Biometrics» more  HICSS 1995»
15 years 4 months ago
HINT: A new way to measure computer performance
The computing community has long faced the problem of scientifically comparing different computers and different algorithms. When architecture, method, precision, or storage capac...
John L. Gustafson, Quinn Snell
CDES
2008
90views Hardware» more  CDES 2008»
15 years 2 months ago
Nanocompilation for the Cell Matrix Architecture
- The Cell Matrix Architecture is a massive array of dynamically self-configurable, uniformly connected, identical computational units. This architecture can enable efficient, prac...
Thomas Way, Rushikesh Katikar, Ch. Purushotham
93
Voted
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 2 months ago
Certifying and repairing solutions to large LPs how good are LP-solvers?
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is general...
Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, K...