Sciweavers

403 search results - page 47 / 81
» Variable ranges in linear constraints
Sort
View
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
14 years 3 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
POPL
2005
ACM
14 years 10 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
14 years 4 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
13 years 11 months ago
Convex formulations of aggregate network air traffic flow optimization problems
The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolutio...
Daniel B. Work, Alexandre M. Bayen
NIPS
2008
13 years 11 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