Sciweavers

544 search results - page 83 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
IJCAI
2001
13 years 9 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
ICANN
2005
Springer
14 years 1 months ago
Varying the Population Size of Artificial Foraging Swarms on Time Varying Landscapes
Abstract. Swarm Intelligence (SI) is the property of a system whereby the collective behaviors of (unsophisticated) entities interacting locally with their environment cause cohere...
Carlos Fernandes, Vitorino Ramos, Agostinho C. Ros...
ICPR
2008
IEEE
14 years 9 months ago
Exploiting qualitative domain knowledge for learning Bayesian network parameters with incomplete data
When a large amount of data are missing, or when multiple hidden nodes exist, learning parameters in Bayesian networks (BNs) becomes extremely difficult. This paper presents a lea...
Qiang Ji, Wenhui Liao
CCR
2006
117views more  CCR 2006»
13 years 8 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
GECCO
2003
Springer
142views Optimization» more  GECCO 2003»
14 years 1 months ago
Revisiting Elitism in Ant Colony Optimization
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
Tony White, Simon Kaegi, Terri Oda