Sciweavers

3318 search results - page 436 / 664
» The Weak Instance Model
Sort
View
SARA
2009
Springer
15 years 10 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
WEA
2010
Springer
243views Algorithms» more  WEA 2010»
15 years 10 months ago
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
LICS
2008
IEEE
15 years 10 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
ICC
2007
IEEE
15 years 10 months ago
Widely Linear Prediction for Blind Equalization
— This paper proposes a new blind equalization scheme based on widely linear (WL) prediction. It permits to compensate non-minimum phase channels with or without spectral nulls, ...
Francisco J. A. de Aquino, Carlos A. F. da Rocha, ...
ICCV
2007
IEEE
15 years 10 months ago
Parsing Images of Architectural Scenes
We address image parsing in the setting of architectural scenes. Our goal is to parse an image into regions of various types such as sky, foliage, buildings, and street. Furthermo...
Alexander C. Berg, Floraine Grabler, Jitendra Mali...