Sciweavers

1452 search results - page 51 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
ESOP
2008
Springer
13 years 11 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
ICDAR
2007
IEEE
14 years 4 months ago
On-Line Handwritten Text Line Detection Using Dynamic Programming
In this paper we propose a novel approach to the detection of on-line handwritten text lines based on dynamic programming. We try to find the paths with the minimum cost between ...
Marcus Liwicki, Emanuel Indermühle, Horst Bun...
MP
1998
109views more  MP 1998»
13 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
JOT
2010
173views more  JOT 2010»
13 years 8 months ago
A Dependence Representation for Coverage Testing of Object-Oriented Programs
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
E. S. F. Najumudheen, Rajib Mall, Debasis Samanta
MEMOCODE
2003
IEEE
14 years 3 months ago
Optimizations for Faster Execution of Esterel Programs
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
Dumitru Potop-Butucaru, Robert de Simone