Sciweavers

2266 search results - page 219 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
COCOON
2009
Springer
15 years 9 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 15 days ago
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
Benjamin Moseley, Sungjin Im
ALGOSENSORS
2006
Springer
15 years 6 months ago
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
Colette Johnen, Le Huy Nguyen
CP
2000
Springer
15 years 7 months ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
GECCO
2010
Springer
151views Optimization» more  GECCO 2010»
15 years 8 months ago
Sustaining behavioral diversity in NEAT
Niching schemes, which sustain population diversity and let an evolutionary population avoid premature convergence, have been extensively studied in the research field of evoluti...
Hirotaka Moriguchi, Shinichi Honiden