Sciweavers

3221 search results - page 237 / 645
» Termination of Linear Programs
Sort
View
AAAI
2006
15 years 7 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
SIAMJO
2010
135views more  SIAMJO 2010»
15 years 4 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
ICST
2009
IEEE
15 years 4 months ago
Euclide: A Constraint-Based Testing Framework for Critical C Programs
Euclide is a new Constraint-Based Testing tool for verifying safety-critical C programs. By using a mixture of symbolic and numerical analyses (namely static single assignment for...
Arnaud Gotlieb
LOPSTR
2007
Springer
16 years 18 days ago
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
Elvira Albert, John P. Gallagher, Miguel Gó...
ICALP
2005
Springer
15 years 12 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...