Sciweavers

5263 search results - page 295 / 1053
» Open Constraint Optimization
Sort
View
FOCM
2010
97views more  FOCM 2010»
15 years 3 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski
COMPSAC
2002
IEEE
15 years 9 months ago
The Architecture of a Dynamically Updatable, Component-Based System
On-the-fly replacement of software may require simultanous distributed updates of components. If an update changes some interfaces or protocols, the update must be performed in a...
Robert Pawel Bialek
IPCO
2008
136views Optimization» more  IPCO 2008»
15 years 6 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza
JFPLC
2001
15 years 6 months ago
Recherche adaptative et contraintes musicales
We propose an environment for musical constraint solving, in the visual programming language OpenMusic. We describe an implementation of a local search algorithm, called adaptive s...
Charlotte Truchet, Carlos Agon, Gérard Assa...
114
Voted
TCBB
2008
73views more  TCBB 2008»
15 years 4 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple