Sciweavers

544 search results - page 19 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
AI
2003
Springer
15 years 8 months ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
Dave A. D. Tompkins, Holger H. Hoos
KES
2007
Springer
15 years 9 months ago
Fuzzy Adaptive Particle Filter for Localization of a Mobile Robot
Localization is one of the important topics in robotics and it is essential to execute a mission. Most problems in the class of localization are due to uncertainties in the modelin...
Young-Joong Kim, Chan-Hee Won, Jung-Min Pak, Myo-T...
APAL
2011
14 years 10 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 8 months ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
109
Voted
AUSAI
2004
Springer
15 years 8 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...