Sciweavers

2652 search results - page 259 / 531
» Privacy-preserving linear programming
Sort
View
SARA
2009
Springer
16 years 1 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
127
Voted
ICC
2007
IEEE
16 years 1 months ago
Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks
—The self-protecting multipath (SPM) is a simple protection switching mechanism that can be implemented, e.g., by MPLS. We present a linear program for the optimization of the SP...
Michael Menth, Rüdiger Martin, Ulrich Spö...
ICMCS
2007
IEEE
128views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Interactive Visualization Tool with Graphic Table of Video Contents
We present an interactive visualization, called Table Of Video Contents (TOVC), for browsing structured TV programs such as news, magazines or sports. In these telecasts, getting ...
Hervé Goeau, Jérôme Thiè...
COCOA
2007
Springer
16 years 1 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar
CP
2007
Springer
16 years 1 months ago
An LP-Based Heuristic for Optimal Planning
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
Menkes van den Briel, J. Benton, Subbarao Kambhamp...