Sciweavers

2677 search results - page 218 / 536
» Locally Served Network Computers
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 8 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
AINA
2007
IEEE
16 years 1 months ago
Context-Aware Elevator Scheduling
Abstract— Research on context-aware systems is usually usercentric and thus focussed on the context of a specific user to serve his or her needs in an optimized way. In this pap...
Thomas Strang, Christian Bauer
LCN
2006
IEEE
16 years 1 months ago
On Cache Prefetching Strategies For Integrated Infostation-Cellular Network
Infostations provide an inexpensive and high speed wireless disseminator that features discontinuous coverage by bounding many low cost, limited transmission range and high-bandwi...
Jerry Chun-Ping Wang, Hossam ElGindy, Justin Lipma...
GECCO
2010
Springer
154views Optimization» more  GECCO 2010»
16 years 1 days ago
Evolutionary learning in networked multi-agent organizations
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...
Jae-Woo Kim
DMSN
2005
ACM
15 years 9 months ago
Zone sharing: a hot-spots decomposition scheme for data-centric storage in sensor networks
In the resource over-constrained environment of sensor networks, techniques for storing data locally in sensor nodes have been proposed to support efficient processing of adhoc qu...
Mohamed Aly, Nicholas Morsillo, Panos K. Chrysanth...