Sciweavers

5153 search results - page 305 / 1031
» Introduction to Randomized Algorithms
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 3 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
108
Voted
ML
2000
ACM
105views Machine Learning» more  ML 2000»
15 years 3 months ago
Multiple Comparisons in Induction Algorithms
Abstract. A single mechanism is responsible for three pathologies of induction algorithms: attribute selection errors, overfitting, and oversearching. In each pathology, induction ...
David D. Jensen, Paul R. Cohen
IAJIT
2010
94views more  IAJIT 2010»
15 years 2 months ago
Multiple Warehouses Scheduling Using Steady State. Genetic Algorithms
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
Jalal Atoum, Mamoun Al Rababaa
JGO
2011
165views more  JGO 2011»
14 years 6 months ago
A biased random-key genetic algorithm for routing and wavelength assignment
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength...
Thiago F. Noronha, Mauricio G. C. Resende, Celso C...
241
Voted
CLUSTER
2011
IEEE
14 years 3 months ago
A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks
  In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the  wireless mobile ad‐hoc networks (MANET) consider...
Javad Akbari Torkestani, Mohammad Reza Meybodi