Sciweavers

2861 search results - page 352 / 573
» Constraint Programming
Sort
View
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
16 years 7 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
4OR
2006
100views more  4OR 2006»
15 years 6 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
ICSE
2009
IEEE-ACM
16 years 1 months ago
Semantics-based code search
Our goal is to use the vast repositories of available open source code to generate specific functions or classes that meet a user’s specifications. The key words here are spec...
Steven P. Reiss
AOR
2010
15 years 3 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi
JCO
2007
80views more  JCO 2007»
15 years 6 months ago
The wireless network jamming problem
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
Clayton W. Commander, Panos M. Pardalos, Valeriy R...