Sciweavers

26354 search results - page 4936 / 5271
» How we refactor, and how we know it
Sort
View
KBSE
2002
IEEE
15 years 11 months ago
Report on the Workshop on the State of the Art in Automated Software Engineering
ort gives their abstracts. s of the position papers Recent Experiences with Code Generation and Task Automation Agents in Software Tools (J. Grundy, J. Hosking) As software grows i...
Yves Ledru, David F. Redmiles
174
Voted
WORDS
2002
IEEE
15 years 11 months ago
Meta-Programming Techniques for Distributed Real-time and Embedded Systems
Commercial off-the-shelf (COTS) middleware increasingly offers not only functional support for standard interfaces, but also the ability to optimize their resource consumption pat...
Joseph K. Cross, Douglas C. Schmidt
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 11 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
173
Voted
SIGMETRICS
2010
ACM
173views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
Channel fragmentation in dynamic spectrum access systems: a theoretical study
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
Edward G. Coffman Jr., Philippe Robert, Florian Si...
163
Voted
SPAA
2010
ACM
15 years 11 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
« Prev « First page 4936 / 5271 Last » Next »