Sciweavers

499 search results - page 57 / 100
» Multilevel algorithms for linear ordering problems
Sort
View
DAM
2006
132views more  DAM 2006»
13 years 7 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
IWANN
2005
Springer
14 years 1 months ago
Input Selection for Long-Term Prediction of Time Series
Prediction of time series is an important problem in many areas of science and engineering. Extending the horizon of predictions further to the future is the challenging and diffic...
Jarkko Tikka, Jaakko Hollmén, Amaury Lendas...
CIKM
1998
Springer
14 years 2 days ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
SIAMMAX
2010
123views more  SIAMMAX 2010»
13 years 2 months ago
Joint Spectral Characteristics of Matrices: A Conic Programming Approach
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
Vladimir Protasov, Raphaël M. Jungers, Vincen...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay