Sciweavers

191 search results - page 9 / 39
» The basic feasible functionals in computable analysis
Sort
View
SPAA
2010
ACM
15 years 13 hour ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
CSO
2009
IEEE
15 years 6 months ago
Competitive Analysis of Online Price Discount Replacement Problem
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
Lili Ding, Xinmin Liu, Wanglin Kang
VTC
2007
IEEE
127views Communications» more  VTC 2007»
15 years 6 months ago
Delay Distribution Analysis of IEEE 802.11 with Variable Packet Length
—The distribution of the delay is a very important measure to determine the performance of a WLAN. Indeed, realtime applications typically require that their packets reach their ...
Paschalis Raptis, Vasileios Vitsas, Albert Banchs,...
ECCC
2000
158views more  ECCC 2000»
14 years 11 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
CCS
2005
ACM
15 years 5 months ago
Exploiting open functionality in SMS-capable cellular networks
Cellular networks are a critical component of the economic and social infrastructures in which we live. In addition to voice services, these networks deliver alphanumeric text mes...
William Enck, Patrick Traynor, Patrick McDaniel, T...