Sciweavers

885 search results - page 116 / 177
» An investigation of the performance of various dynamic sched...
Sort
View
TCAD
1998
114views more  TCAD 1998»
13 years 8 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
NCA
2007
IEEE
14 years 3 months ago
Impact of request dispatching granularity in geographically distributed Web systems
The advent of the mobile Web and the increasing demand for personalized contents arise the need for computationally expensive services, such as dynamic generation and on-thefly a...
Mauro Andreolini, Claudia Canali, Riccardo Lancell...
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
14 years 19 days ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
JCSS
2008
81views more  JCSS 2008»
13 years 8 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
ICMCS
2006
IEEE
128views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Game-Theoretic Paradigm for Resource Management in Spectrum Agile Wireless Networks
We propose a new way of architecting the wireless multimedia communications systems by jointly optimizing the protocol stack at each station and the resource exchanges among stati...
Fangwen Fu, Ahmad Reza Fattahi, Mihaela van der Sc...