Sciweavers

4335 search results - page 182 / 867
» Privatizing Constraint Optimization
Sort
View
KI
2009
Springer
15 years 10 months ago
Constraint-Based Integration of Plan Tracking and Prognosis for Autonomous Production
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...
Paul Maier, Martin Sachenbacher, Thomas Rühr,...
113
Voted
ICASSP
2008
IEEE
15 years 10 months ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin
CP
2007
Springer
15 years 9 months ago
Model-Driven Visualizations of Constraint-Based Local Search
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet ...
Grégoire Dooms, Pascal Van Hentenryck, Laur...
CP
1995
Springer
15 years 7 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
138
Voted
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 5 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...