Sciweavers

3143 search results - page 376 / 629
» Minimization of entropy functionals
Sort
View
DAC
1989
ACM
15 years 10 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
ALDT
2009
Springer
126views Algorithms» more  ALDT 2009»
15 years 10 months ago
On Low-Envy Truthful Allocations
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
DEXAW
2009
IEEE
93views Database» more  DEXAW 2009»
15 years 10 months ago
The Secure Pipes and Filters Pattern
Many applications process or transform a stream of data. Such applications are organized as a sequence of different stages, which may be independent enough to be simultaneously car...
Eduardo B. Fernandez, Jorge L. Ortega-Arjona
GLOBECOM
2007
IEEE
15 years 10 months ago
Efficient Scheduling for Heterogeneous Services in OFDMA Downlink
We consider optimal allocation of resources to users in a downlink OFDMA system to support heterogeneous applications consisting of both deadline-sensitive (DS) and best-effort (BE...
Rajiv Agarwal, Vinay R. Majjigi, Rath Vannithamby,...
ACMSE
2006
ACM
15 years 10 months ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.