Sciweavers

3663 search results - page 299 / 733
» Problems in the ontology of computer programs
Sort
View
FOSSACS
2007
Springer
16 years 27 days ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
175
Voted
SAC
2006
ACM
16 years 20 days ago
Towards a model-driven join point model
Aspect–Oriented Programming (AOP) is increasingly being adopted by developers to better modularize object–oriented design by introducing crosscutting concerns. However, due to...
Walter Cazzola, Antonio Cicchetti, Alfonso Pierant...
ISORC
2008
IEEE
16 years 1 months ago
Obstacles in Worst-Case Execution Time Analysis
The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information aut...
Raimund Kirner, Peter P. Puschner
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
16 years 23 days ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
CP
2005
Springer
16 years 7 days ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings