Sciweavers

4816 search results - page 178 / 964
» Performance analysis of the AntNet algorithm
Sort
View
CVPR
2012
IEEE
13 years 8 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
ICPADS
2007
IEEE
16 years 19 days ago
A scheduling algorithm for revenue maximisation for cluster-based Internet services
This paper proposes a new priority scheduling algorithm to maximise site revenue of session-based multi-tier Internet services in a multicluster environment. This research is part...
James Wen Jun Xue, Ligang He, Stephen A. Jarvis
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
16 years 14 days ago
Adaptive variance scaling in continuous multi-objective estimation-of-distribution algorithms
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
Peter A. N. Bosman, Dirk Thierens
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 11 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
15 years 12 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck