Sciweavers

995 search results - page 101 / 199
» Wire-speed total order
Sort
View
FUIN
2007
95views more  FUIN 2007»
13 years 8 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
TSP
2008
145views more  TSP 2008»
13 years 8 months ago
Multichannel ALLIANCES: A Cooperative Cross-Layer Scheme for Wireless Networks
A random access protocol named ALLIANCES was recently proposed, that achieves high throughput by resolving collisions in wireless networks. ALLIANCES exploits diversity provided b...
Lun Dong, Athina P. Petropulu
VC
2008
102views more  VC 2008»
13 years 8 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
CORR
1998
Springer
135views Education» more  CORR 1998»
13 years 8 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
MST
2007
132views more  MST 2007»
13 years 8 months ago
Odometers on Regular Languages
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
Valérie Berthé, Michel Rigo