Sciweavers

2080 search results - page 229 / 416
» Measuring empirical computational complexity
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 9 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong
AIPS
2008
15 years 8 months ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu
GEOINFO
2003
15 years 7 months ago
Planning Brazilian Urban Traffic with a Geographic Application Software
Planning and optimizing urban traffic is a difficult problem, with considerable economic and social impacts. The development of suitable software tools to aid municipal governments...
Juliano Lopes de Oliveira, André Constantin...
AI
2011
Springer
15 years 29 days ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
ICML
2004
IEEE
16 years 6 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...