Sciweavers

4037 search results - page 68 / 808
» Routing without ordering
Sort
View
CN
2002
169views more  CN 2002»
13 years 8 months ago
A new wireless ad hoc multicast routing protocol
An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing prot...
Seungjoon Lee, Chongkwon Kim
SAJ
2002
127views more  SAJ 2002»
13 years 8 months ago
Limited flooding protocol for mobile ad hoc networks
Mobile ad hoc networks are collections of mobile nodes without any fixed infrastructure or central co-ordinating mechanism for packet routing. Consequently, routing is a challenge...
Mieso K. Denko, W. Goddard
AGP
1999
IEEE
14 years 1 months ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning
IJCAI
2001
13 years 10 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 9 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...