Sciweavers

1494 search results - page 238 / 299
» Less Extreme Programming
Sort
View
ISSTA
2010
ACM
15 years 4 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
CIMAGING
2008
85views Hardware» more  CIMAGING 2008»
15 years 3 months ago
Technology-assisted dietary assessment
Dietary intake provides valuable insights for mounting intervention programs for prevention of disease. With growing concern for adolescent obesity, the need to accurately measure...
Fengqing Zhu, Anand Mariappan, Carol J. Boushey, D...
IADIS
2008
15 years 3 months ago
Dagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fi...
IPCO
2008
163views Optimization» more  IPCO 2008»
15 years 3 months ago
The Air Traffic Flow Management Problem: An Integer Optimization Approach
In this paper, we present a new Integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. The model we propose provides a complete representation of all the phases o...
Dimitris Bertsimas, Guglielmo Lulli, Amedeo R. Odo...
NIPS
2008
15 years 3 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola