Sciweavers

706 search results - page 38 / 142
» Super Solutions in Constraint Programming
Sort
View
CP
2005
Springer
15 years 5 months ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz
EUSFLAT
2001
15 years 1 months ago
A new approach to fuzzy goal programming
The multiobjective problem with fuzzy goals (which may also represent fuzzy right hand sides of the constraints) is formulated as a fuzzy goal programming problem. A new approach ...
Stefan Chanas, Dorota Kuchta
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
15 years 3 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
ICPR
2008
IEEE
15 years 6 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
TSP
2010
14 years 6 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar