Sciweavers

630 search results - page 87 / 126
» Hardness results for approximating the bandwidth
Sort
View
IWPC
2005
IEEE
15 years 11 months ago
Concise and Consistent Naming
Approximately 70% of the source code of a software system consists of identifiers. Hence, the names chosen as identifiers are of paramount importance for the readability of comp...
Florian Deißenböck, Markus Pizka
MFCS
2005
Springer
15 years 11 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
CDC
2009
IEEE
141views Control Systems» more  CDC 2009»
15 years 11 months ago
Periodic power management schemes for real-time event streams
Abstract— Power dissipation has constrained the performance boosting of modern computer systems in the past decade. Dynamic power management (DPM) has been implemented in many sy...
Kai Huang, Luca Santinelli, Jian-Jia Chen, Lothar ...
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
15 years 10 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
FPL
2000
Springer
96views Hardware» more  FPL 2000»
15 years 9 months ago
Generation of Design Suggestions for Coarse-Grain Reconfigurable Architectures
Coarse-grain reconfigurable architectures have been a matter of intense research in the last few years. They promise to be more adequate for computational tasks due to their better...
Reiner W. Hartenstein, Michael Herz, Thomas Hoffma...