Sciweavers

    12015 search results - page 515 / 2403
    » Interactive Algorithms 2005
    Sort
    View
    SPAA
    2005
    ACM
    81views Distributed And Parallel Com...» more  SPAA 2005»
    Efficient algorithms for verifying memory consistency
    15 years 10 months ago
    Efficient algorithms for verifying memory consistency
    Download  www-cs-students.stanford.edu
    One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
    Chaiyasit Manovit, Sudheendra Hangal
    claim paper
    Read More »
    133
    Voted
    AAIM
    2005
    Springer
    110views Algorithms» more  AAIM 2005»
    Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
    15 years 10 months ago
    Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
    Download  www.engr.uconn.edu
    Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
    Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh
    claim paper
    Read More »
    ECML
    2005
    Springer
    154views Machine Learning» more  ECML 2005»
    U-Likelihood and U-Updating Algorithms: Statistical Inference in Latent Variable Models
    15 years 10 months ago
    U-Likelihood and U-Updating Algorithms: Statistical Inference in Latent Variable Models
    Download  eprints.pascal-network.org
    Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
    JaeMo Sung, Sung Yang Bang, Seungjin Choi, Zoubin ...
    claim paper
    Read More »
    EMO
    2005
    Springer
    194views Optimization» more  EMO 2005»
    An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
    15 years 10 months ago
    An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
    Download  www.liacs.nl
    Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
    Michael Emmerich, Nicola Beume, Boris Naujoks
    claim paper
    Read More »
    138
    Voted
    GECCO
    2005
    Springer
    126views Optimization» more  GECCO 2005»
    Not all linear functions are equally difficult for the compact genetic algorithm
    15 years 10 months ago
    Not all linear functions are equally difficult for the compact genetic algorithm
    Download  www.cs.bham.ac.uk
    Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
    Stefan Droste
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.