Sciweavers

414 search results - page 44 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
COCOA
2009
Springer
14 years 3 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
CASES
2004
ACM
14 years 14 days ago
Translating affine nested-loop programs to process networks
New heterogeneous multiprocessor platforms are emerging that are typically composed of loosely coupled components that exchange data using programmable interconnections. The compon...
Alexandru Turjan, Bart Kienhuis, Ed F. Deprettere
LCTRTS
2001
Springer
14 years 1 months ago
A Dynamic Programming Approach to Optimal Integrated Code Generation
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
Christoph W. Keßler, Andrzej Bednarski
ENDM
2010
101views more  ENDM 2010»
13 years 8 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ICASSP
2011
IEEE
13 years 14 days ago
A combined linear programming-maximum likelihood approach to radial velocity data analysis for extrasolar planet detection
In this paper we introduce a new technique for estimating the parameters of the Keplerian model commonly used in radial velocity data analysis for extrasolar planet detection. The...
Prabhu Babu, Petre Stoica