Sciweavers

1550 search results - page 212 / 310
» Optimizing search by showing results in context
Sort
View
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 4 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
ICASSP
2011
IEEE
14 years 10 months ago
A novel algorithm of seeking FrFT order for speech processing
The determination of the optimal fractional Fourier transform (FrFT) order is a crucial issue for FrFT. This paper introduces a novel algorithm is proposed for the estimation of F...
Duo-jia Ma, Xiang Xie, Jingming Kuang
CPAIOR
2010
Springer
15 years 11 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 10 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...
ICFCA
2007
Springer
16 years 16 days ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...