Sciweavers

1941 search results - page 259 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
14 years 8 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
MOBISYS
2007
ACM
15 years 9 months ago
Context-aware access to public shared devices
To allow for an efficient usage of a device in pervasive computing environments, reliable and yet convenient user access is an important requirement. The problem becomes more comp...
David Jea, Ian Yap, Mani B. Srivastava
SBRN
2008
IEEE
15 years 4 months ago
Imitation Learning of an Intelligent Navigation System for Mobile Robots Using Reservoir Computing
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
CCR
2010
100views more  CCR 2010»
14 years 10 months ago
Towards understanding bugs in open source router software
Software errors and vulnerabilities in core Internet routers have led to several high-profile attacks on the Internet infrastructure and numerous outages. Building an understandin...
Zuoning Yin, Matthew Caesar, Yuanyuan Zhou
ANCS
2007
ACM
15 years 2 months ago
Frame-aggregated concurrent matching switch
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
Bill Lin, Isaac Keslassy