Sciweavers

4816 search results - page 567 / 964
» Performance analysis of the AntNet algorithm
Sort
View
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 10 months ago
Particle swarm with speciation and adaptation in a dynamic environment
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
Xiaodong Li, Jürgen Branke, Tim Blackwell
ML
2008
ACM
15 years 6 months ago
A bias/variance decomposition for models using collective inference
Bias/variance analysis is a useful tool for investigating the performance of machine learning algorithms. Conventional analysis decomposes loss into errors due to aspects of the le...
Jennifer Neville, David Jensen
FOCS
2008
IEEE
15 years 8 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
ECAI
1994
Springer
15 years 11 months ago
Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
W. P. M. Nuijten, Emile H. L. Aarts
AUSAI
2007
Springer
15 years 11 months ago
Weight Redistribution for Unweighted MAX-SAT
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar