Sciweavers

3422 search results - page 123 / 685
» Random Subset Optimization
Sort
View
LSSC
2007
Springer
15 years 11 months ago
Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
Stefka Fidanova
EUSFLAT
2007
126views Fuzzy Logic» more  EUSFLAT 2007»
15 years 6 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 ...
MP
1998
105views more  MP 1998»
15 years 4 months ago
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
Gert A. Tijssen, Gerard Sierksma
FOCS
2004
IEEE
15 years 8 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
ICDE
2010
IEEE
209views Database» more  ICDE 2010»
15 years 11 months ago
Optimal tree node ordering for child/descendant navigations
Abstract— There are many applications in which users interactively access huge tree data by repeating set-based navigations. In this paper, we focus on label-specific/wildcard c...
Atsuyuki Morishima, Keishi Tajima, Masateru Tadais...