Sciweavers

2436 search results - page 233 / 488
» Comonadic Notions of Computation
Sort
View
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 11 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
RELMICS
2009
Springer
15 years 11 months ago
Foundations of Concurrent Kleene Algebra
Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent n [10]. In this paper we investigate ...
C. A. R. Hoare, Bernhard Möller, Georg Struth...
ICALP
2001
Springer
15 years 11 months ago
Combinatorics of Periods in Strings
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
Eric Rivals, Sven Rahmann
ICC
2000
IEEE
144views Communications» more  ICC 2000»
15 years 11 months ago
Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks
– This paper presents a novel routing protocol for wireless ad hoc networks – Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce rou...
Guangyu Pei, Mario Gerla, Tsu-Wei Chen
DCW
2000
Springer
15 years 11 months ago
The GIPSY Architecture
Intensional Programming involves the programming of expressions placed in an inherent multidimensional context space. It is an emerging and highly dynamic domain of general applica...
Joey Paquet, Peter G. Kropf