Sciweavers

338 search results - page 33 / 68
» Fast distributed random walks
Sort
View
61
Voted
WAC
2005
Springer
15 years 3 months ago
On Natural Mobility Models
Abstract. There is an increasing consensus that existing mobility models, such as the well-known random walk or random waypoint models, are insufficient to represent real node mobi...
Vincent Borrel, Marcelo Dias de Amorim, Serge Fdid...
IJCSA
2007
104views more  IJCSA 2007»
14 years 9 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
INFOCOM
1999
IEEE
15 years 1 months ago
The Window Distribution of Idealized TCP Congestion Avoidance with Variable Packet Loss
Abstract--This paper analyzes the stationary behavior of the TCP congestion window performing ideal congestion avoidance when the packet loss probability is not constant, but varie...
Archan Misra, Teunis J. Ott
CORR
2002
Springer
132views Education» more  CORR 2002»
14 years 9 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter
71
Voted
CN
2007
122views more  CN 2007»
14 years 9 months ago
Impact of mobility on the performance of relaying in ad hoc networks - Extended version
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...