Sciweavers

1197 search results - page 151 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ICC
2007
IEEE
145views Communications» more  ICC 2007»
14 years 2 months ago
Distributed Optimization for Utility-Energy Tradeoff in Wireless Sensor Networks
Abstract— Wireless sensor networks (WSNs) are energyconstrained in nature, in this paper, we formulate the problem of data transport in sensor networks as a network utility maxim...
Shengbin Liao, Wenqing Cheng, Wei Liu, Zongkai Yan...
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
Minimizing weighted sum delay for one-to-many file transfer in peer-to-peer networks
Abstract-- This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weig...
Bike Xie, Mihaela van der Schaar, Richard D. Wesel
ECRTS
1999
IEEE
14 years 15 days ago
The case for feedback control real-time scheduling
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
Jack A. Stankovic, Chenyang Lu, Sang Hyuk Son, Gan...
SAT
2009
Springer
91views Hardware» more  SAT 2009»
14 years 2 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
DCOSS
2009
Springer
14 years 2 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...