Sciweavers

570 search results - page 30 / 114
» On the number of zero-sum subsequences
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Optimal Hopping in Ad Hoc Wireless Networks
— Gupta and Kumar showed that throughput in a static random wireless network increases with the amount of hopping. In a subsequent paper (2004), it was shown that although throug...
Abbas El Gamal, James P. Mammen
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
14 years 3 months ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
CSB
2003
IEEE
101views Bioinformatics» more  CSB 2003»
14 years 3 months ago
Stochastic Stage-structured Modeling of the Adaptive Immune System
We have constructed a computer model of the cytotoxic T lymphocyte (CTL) response to antigen and the maintenance of immunological memory. Because immune responses often begin with...
Dennis L. Chao, Miles P. Davenport, Stephanie Forr...
COMPSAC
2002
IEEE
14 years 2 months ago
Renaissance: A Method to Support Software System Evolution
Legacy systems are often business critical and are associated with high maintenance costs. In this paper, we present an overview of a method, Renaissance, which aims to manage the...
Ian Warren, Jane Ransom
P2P
2002
IEEE
103views Communications» more  P2P 2002»
14 years 2 months ago
Request Algorithms in Freenet-Style Peer-to-Peer Systems
In most peer-to-peer systems, edge resources self-organize into overlay networks. At the core of Freenet-style peer-to-peer systems are insert and request algorithms that dynamica...
Jens Mache, Melanie Gilbert, Jason Guchereau, Jeff...