Sciweavers

1404 search results - page 133 / 281
» Optimization problems in multiple-interval graphs
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 4 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
IPPS
2000
IEEE
15 years 2 months ago
Optimization of Motion Estimator for Run-Time-Reconfiguration Implementation
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
Camel Tanougast, Yves Berviller, Serge Weber
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 1 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
IANDC
2008
141views more  IANDC 2008»
14 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
ATAL
2010
Springer
14 years 11 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings