Sciweavers

1603 search results - page 175 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
ASPDAC
2008
ACM
135views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Temperature-aware MPSoC scheduling for reducing hot spots and gradients
Thermal hot spots and temperature gradients on the die need to be minimized to manufacture reliable systems while meeting energy and performance constraints. In this work, we solve...
Ayse Kivilcim Coskun, Tajana Simunic Rosing, Keith...
CSR
2007
Springer
16 years 21 days ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
COLT
2004
Springer
15 years 10 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
JSA
2007
191views more  JSA 2007»
15 years 6 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
CJ
2010
128views more  CJ 2010»
15 years 6 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...