Sciweavers

225 search results - page 27 / 45
» On Adaptive Integer Sorting
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
ASM
2004
ASM
14 years 1 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
ASPLOS
1996
ACM
14 years 19 days ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
RTSS
1999
IEEE
14 years 22 days ago
A Scalable Solution to the Multi-Resource QoS Problem
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
Chen Lee, John P. Lehoczky, Daniel P. Siewiorek, R...
MP
2002
143views more  MP 2002»
13 years 8 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck