Sciweavers

1421 search results - page 67 / 285
» Algorithms for subsequence combinatorics
Sort
View
EUSFLAT
2007
126views Fuzzy Logic» more  EUSFLAT 2007»
15 years 4 months ago
Selecting the Optimal Rule Set Using a Bacterial Evolutionary Algorithm
In many regression learning algorithms for fuzzy rule bases it is not possible to define the error measure to be optimized freely. A possible alternative is the usage of global o...
Mario Drobics, János Botzheim, Klaus-Peter ...
NETWORKS
1998
15 years 2 months ago
Project scheduling with multiple modes: A comparison of exact algorithms
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
Sönke Hartmann, Andreas Drexl
ICCCI
2009
Springer
15 years 22 days ago
Firefly Algorithm for Continuous Constrained Optimization Tasks
Abstract. The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks. The presented technique is in...
Szymon Lukasik, Slawomir Zak
ISCC
2003
IEEE
15 years 8 months ago
Provisioning Algorithms in Survivable Optical Networks with Shared Protection
The efficient use of network capacity strongly depends upon the path selection procedure. In this paper we propose and evaluate efficient path selection algorithms for survivable ...
Chadi Assi, Ahmad Khalil, Nasir Ghani, Mohamed A. ...
MOC
1998
107views more  MOC 1998»
15 years 2 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche