Sciweavers

1186 search results - page 60 / 238
» Improving Random Walk Performance
Sort
View
ICC
2008
IEEE
121views Communications» more  ICC 2008»
15 years 4 months ago
Performance of ALOHA and CSMA in Spatially Distributed Wireless Networks
—In this paper the performance of unslotted ALOHA and CSMA are analyzed in spatially distributed wireless networks. Users/packets arrive randomly in space and time according to a...
Mariam Kaynia, Nihar Jindal
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 1 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
PAA
2002
14 years 9 months ago
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
Marina Skurichina, Robert P. W. Duin
ICIP
2005
IEEE
15 years 11 months ago
A segmentation method using compound Markov random fields based on a general boundary model
Markov random field (MRF) theory has widely been applied to segmentation in noisy images. This paper proposes a new MRF method. First, it couples the original labeling MRF with a ...
Jue Wu, Albert C. S. Chung
CADE
2008
Springer
15 years 10 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