Sciweavers

693 search results - page 42 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
ATAL
2007
Springer
15 years 10 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
VIS
2009
IEEE
399views Visualization» more  VIS 2009»
16 years 5 months ago
Visual Human+Machine Learning
In this paper we describe a novel method to integrate interactive visual analysis and machine learning to support the insight generation of the user. The suggested approach combine...
Raphael Fuchs, Jürgen Waser, Meister Eduard GrÃ...
128
Voted
TEC
2008
98views more  TEC 2008»
15 years 3 months ago
A Fast Incremental Hypervolume Algorithm
When hypervolume is used as part of the selection or archiving process in a multiobjective evolutionary algorithm, it is necessary to determine which solutions contribute the least...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 8 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
CEC
2010
IEEE
15 years 5 months ago
An analysis of massively distributed evolutionary algorithms
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
Travis J. Desell, David P. Anderson, Malik Magdon-...