Sciweavers

Share
120 search results - page 24 / 24
» Randomized Local Search, Evolutionary Algorithms, and the Mi...
Sort
View
EOR
2007
198views more  EOR 2007»
9 years 10 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
FOCS
2002
IEEE
10 years 3 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
ADHOC
2015
4 years 6 months ago
Characterizing topological bottlenecks for data delivery in CTP using simulation-based stress testing with natural selection
Routing protocols for ad-hoc networks, e.g., the Collection Tree Protocol (CTP), are designed with simple node-local behaviour, but are deployed on testbeds with uncontrollable ph...
Doina Bucur, Giovanni Iacca, Pieter-Tjerk de Boer
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
10 years 11 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
GECCO
2003
Springer
10 years 3 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
books