Sciweavers

523 search results - page 53 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
TSP
2010
13 years 3 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
FOCS
2010
IEEE
13 years 6 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
INFOCOM
2011
IEEE
13 years 7 days ago
BodyT2: Throughput and time delay performance assurance for heterogeneous BSNs
—Body sensor networks (BSNs) have been developed for a set of performance-critical applications, including smart healthcare, assisted living, emergency response, athletic perform...
Zhen Ren, Gang Zhou, Andrew Pyles, Matthew Keally,...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 2 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ROBOCOMM
2007
IEEE
14 years 3 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme