Sciweavers

    DAGSTUHL
    2006
    135views Software Engineering» more  DAGSTUHL 2006»
    Adaptive Analysis of On-line Algorithms
    13 years 7 months ago
    Adaptive Analysis of On-line Algorithms
    Download  drops.dagstuhl.de
    Reza Dorrigiv, Alejandro López-Ortiz
    claim paper
    Read More »
    DAGSTUHL
    2006
    142views Software Engineering» more  DAGSTUHL 2006»
    Competitive Online Searching for a Ray in the Plane
    13 years 7 months ago
    Competitive Online Searching for a Ray in the Plane
    Download  web.informatik.uni-bonn.de
    We consider the problem of a searcher that looks for a lost flashlight in a dusty environment. The search agent finds the flashlight as soon as it crosses the ray emanating from t...
    Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans,...
    claim paper
    Read More »
    DAGSTUHL
    2006
    164views Software Engineering» more  DAGSTUHL 2006»
    On Complexity of Optimized Crossover for Binary Representations
    13 years 7 months ago
    On Complexity of Optimized Crossover for Binary Representations
    Download  drops.dagstuhl.de
    We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
    Anton V. Eremeev
    claim paper
    Read More »
    DAGSTUHL
    2006
    124views Software Engineering» more  DAGSTUHL 2006»
    06061 Abstracts Collection -- Theory of Evolutionary Algorithms
    13 years 7 months ago
    06061 Abstracts Collection -- Theory of Evolutionary Algorithms
    Download  drops.dagstuhl.de
    Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, M...
    claim paper
    Read More »
    DAGSTUHL
    2006
    142views Software Engineering» more  DAGSTUHL 2006»
    The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle
    13 years 7 months ago
    The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle
    Download  muehlenbein.org
    Heinz Mühlenbein, Robin Höns
    claim paper
    Read More »
    DAGSTUHL
    2006
    137views Software Engineering» more  DAGSTUHL 2006»
    How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small
    13 years 7 months ago
    How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small
    Download  drops.dagstuhl.de
    One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
    Boris Mitavskiy, Jonathan E. Rowe
    claim paper
    Read More »
    DAGSTUHL
    2006
    174views Software Engineering» more  DAGSTUHL 2006»
    6D SLAM with Cached kd-tree Search
    13 years 7 months ago
    6D SLAM with Cached kd-tree Search
    Download  drops.dagstuhl.de
    6D SLAM (Simultaneous Localization and Mapping) or 6D Concurrent Localization and Mapping of mobile robots considers six degrees of freedom for the robot pose, namely, the x, y and...
    Andreas Nüchter, Kai Lingemann, Joachim Hertz...
    claim paper
    Read More »
    DAGSTUHL
    2006
    103views Software Engineering» more  DAGSTUHL 2006»
    On Probabilistic Time versus Alternating Time
    13 years 7 months ago
    On Probabilistic Time versus Alternating Time
    Download  www1.cs.columbia.edu
    Emanuele Viola
    claim paper
    Read More »
    DAGSTUHL
    2006
    154views Software Engineering» more  DAGSTUHL 2006»
    The complexity of Boolean functions from cryptographic viewpoint
    13 years 7 months ago
    The complexity of Boolean functions from cryptographic viewpoint
    Download  drops.dagstuhl.de
    Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
    Claude Carlet
    claim paper
    Read More »
    DAGSTUHL
    2006
    124views Software Engineering» more  DAGSTUHL 2006»
    The optimal sequence compression
    13 years 7 months ago
    The optimal sequence compression
    Download  drops.dagstuhl.de
    This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
    Alexander E. Andreev
    claim paper
    Read More »
    « first‹ previous…242526272829303132…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.