Sciweavers

1274 search results - page 170 / 255
» Graph lambda theories
Sort
View
SPAA
2005
ACM
14 years 2 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
APN
2005
Springer
14 years 2 months ago
High-Level Nets with Nets and Rules as Tokens
Abstract. High-Level net models following the paradigm “nets as tokens” have been studied already in the literature with several interesting applications. In this paper we prop...
Kathrin Hoffmann, Hartmut Ehrig, Till Mossakowski
ATAL
2005
Springer
14 years 2 months ago
Formation of cooperation structure by interaction network in directed multi-agent
A directed agent implies an agent with high constraints in both recognition and motion. Because of the embodied restrictions, the directed agent perceives a sense of subjective di...
Kosuke Sekiyama, Yukihisa Okade
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
14 years 2 months ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
PODC
2003
ACM
14 years 2 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing