Sciweavers

373 search results - page 24 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
13 years 11 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
DL
2000
Springer
173views Digital Library» more  DL 2000»
14 years 12 days ago
Content-based book recommending using learning for text categorization
Recommender systems improve access to relevant products and information by making personalized suggestions based on previous examples of a user's likes and dislikes. Most exi...
Raymond J. Mooney, Loriene Roy
JMLR
2006
125views more  JMLR 2006»
13 years 8 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
CEC
2005
IEEE
14 years 1 months ago
A model-based evolutionary algorithm for bi-objective optimization
Abstract- The Pareto optimal solutions to a multiobjective optimization problem often distribute very regularly in both the decision space and the objective space. Most existing ev...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Edward P. K....
IPSN
2007
Springer
14 years 2 months ago
Probabilistic detection of mobile targets in heterogeneous sensor networks
Target detection and field surveillance are among the most prominent applications of Sensor Networks (SN). The quality of detection achieved by a SN can be quantified by evaluat...
Loukas Lazos, Radha Poovendran, James A. Ritcey