Sciweavers

1972 search results - page 42 / 395
» connection 2008
Sort
View
CADE
2008
Springer
14 years 8 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
PIMRC
2008
IEEE
14 years 2 months ago
Connectivity of wireless ad hoc networks with random beamforming: An analytical approach
Random beamforming, where each node selects a main beam direction without any coordination with other nodes, has been proposed as a simple technique to improve connectivity in wire...
Salman Durrani, Xiangyun Zhou, Haley M. Jones
VTC
2008
IEEE
114views Communications» more  VTC 2008»
14 years 2 months ago
Improving Ad Hoc Networks Capacity and Connectivity Using Dynamic Blind Beamforming
— We propose a dynamic blind beamforming scheme which allows to benefit from antenna directivity in large mobile ad hoc networks while avoiding heavy feedback to track mobile no...
Nadia Fawaz, Zafer Beyaztas, David Gesbert, M&eacu...
WIMOB
2008
IEEE
14 years 2 months ago
Movement and Connectivity Algorithms for Location-Based Mobile Social Networks
In this paper we present a novel algorithm aiming at connecting members of a community equipped with mobile devices based on their location. Initially, these users are far from ea...
Bayrem Chelly, Naceur Malouch
CN
1998
64views more  CN 1998»
13 years 8 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani