Sciweavers

1723 search results - page 193 / 345
» Cycling in linear programming problems
Sort
View
APLAS
2010
ACM
14 years 8 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
COR
2010
123views more  COR 2010»
14 years 10 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
CPAIOR
2004
Springer
15 years 1 months ago
Building Models through Formal Specification
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
Gerrit Renker, Hatem Ahriz
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
ICCD
2000
IEEE
116views Hardware» more  ICCD 2000»
15 years 6 months ago
Representing and Scheduling Looping Behavior Symbolically
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
Steve Haynal, Forrest Brewer