Sciweavers

115 search results - page 11 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
156
Voted
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 11 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
DCC
2003
IEEE
16 years 1 months ago
Linear Programming Optimization for Video Coding under Multiple Constraints
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Yegnaswamy Sermadevi, Sheila S. Hemami
96
Voted
BMCBI
2011
14 years 9 months ago
Dynamic programming re-ranking for PPI interactor and pair extraction in full-text articles
Background: Experimentally verified protein-protein interactions (PPIs) cannot be easily retrieved by researchers unless they are stored in PPI databases. The curation of such dat...
Richard Tzong-Han Tsai, Po-Ting Lai
KBSE
2010
IEEE
15 years 9 days ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
135
Voted
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 1 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan