Sciweavers

2252 search results - page 62 / 451
» Improving Random Forests
Sort
View
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
ICML
2008
IEEE
14 years 8 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
IJSNET
2006
133views more  IJSNET 2006»
13 years 8 months ago
On the hop count statistics for randomly deployed wireless sensor networks
: In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless ...
Stefan Dulman, Michele Rossi, Paul J. M. Havinga, ...
VTC
2007
IEEE
107views Communications» more  VTC 2007»
14 years 2 months ago
Random Switched Beamforming for Uplink Wireless Sensor Networks
– Integration of beamforming to sensors is very beneficial for a reduction of transmission power consumption and for improvement of the overall system performance. Unfortunately,...
Mohammed Elmusrati, Vesa Hasu
AAAI
2007
13 years 10 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck