Sciweavers

249 search results - page 26 / 50
» Analysis of Resource Lower Bounds in Real-Time Applications
Sort
View
ICALP
2004
Springer
15 years 3 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
ICML
1995
IEEE
15 years 10 months ago
Learning to Make Rent-to-Buy Decisions with Systems Applications
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
P. Krishnan, Philip M. Long, Jeffrey Scott Vitter
MFCS
2005
Springer
15 years 3 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
72
Voted
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
15 years 3 months ago
Bitwidth-aware scheduling and binding in high-level synthesis
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
Jason Cong, Yiping Fan, Guoling Han, Yizhou Lin, J...
PG
2007
IEEE
15 years 3 months ago
Faceting Artifact Analysis for Computer Graphics
The faceting signal, defined in this paper as the difference signal between a rendering of the original geometric model and a simplified version of the geometric model, is respo...
Lijun Qu, Gary W. Meyer