2864 search results - page 208 / 573 » Constraint Programming in OPL |
FOCS
1991
IEEE
14 years 2 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
PAAPP
2002
13 years 10 months ago
2002
We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...
IFIP
2010
Springer
13 years 5 months ago
2010
Springer
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
ECOOP
2011
Springer
12 years 10 months ago
2011
Springer
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...