Sciweavers

592 search results - page 43 / 119
» Using Constraint Programming to Solve the Maximum Clique Pro...
Sort
View
ESORICS
2010
Springer
15 years 3 months ago
Secure Multiparty Linear Programming Using Fixed-Point Arithmetic
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
Octavian Catrina, Sebastiaan de Hoogh
PLDI
2004
ACM
15 years 8 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
JCO
2011
63views more  JCO 2011»
14 years 6 months ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
IOR
2006
173views more  IOR 2006»
15 years 3 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
CORR
2012
Springer
185views Education» more  CORR 2012»
13 years 10 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens