Sciweavers

243 search results - page 28 / 49
» How to Solve It Automatically: Selection Among Problem Solvi...
Sort
View
TC
2010
13 years 5 months ago
The Design and Evaluation of a Self-Organizing Superpeer Network
—Superpeer architectures exploit the heterogeneity of nodes in a peer-to-peer (P2P) network by assigning additional responsibilities to higher capacity nodes. In the design of a ...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
AAAI
2004
13 years 9 months ago
Learning and Applying Competitive Strategies
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
Esther Lock, Susan L. Epstein
CISS
2008
IEEE
14 years 2 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
JSAC
2008
111views more  JSAC 2008»
13 years 7 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
DATE
2002
IEEE
123views Hardware» more  DATE 2002»
14 years 14 days ago
False Path Elimination in Quasi-Static Scheduling
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
G. Arrigoni, L. Duchini, Claudio Passerone, Lucian...