Sciweavers

    258 search results - page 39 / 52
    » New Lower Bounds for Heilbronn Numbers
    Sort
    View
    AIEDAM
    2008
    127views more  AIEDAM 2008»
    Evolving blackbox quantum algorithms using genetic programming
    13 years 7 months ago
    Evolving blackbox quantum algorithms using genetic programming
    Download  e3.physik.uni-dortmund.de
    Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
    Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
    claim paper
    Read More »
    JCB
    2008
    144views more  JCB 2008»
    Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
    13 years 7 months ago
    Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
    Download  www.cse.sc.edu
    Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
    Max A. Alekseyev
    claim paper
    Read More »
    TSP
    2008
    71views more  TSP 2008»
    Multiple Description Trellis-Coded Quantization of Sinusoidal Parameters
    13 years 7 months ago
    Multiple Description Trellis-Coded Quantization of Sinusoidal Parameters
    Download  imi.aau.dk
    A new scheme for sinusoidal audio coding named multiple description spherical trellis-coded quantization is proposed and analytic expressions for the point densities and expected d...
    Morten Holm Larsen, Mads Græsbøll Chr...
    claim paper
    Read More »
    MOC
    2000
    76views more  MOC 2000»
    Optimal approximation of stochastic differential equations by adaptive step-size control
    13 years 7 months ago
    Optimal approximation of stochastic differential equations by adaptive step-size control
    Download  www.ams.org
    We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...
    Norbert Hofmann, Thomas Müller-Gronbach, Klau...
    claim paper
    Read More »
    IJMC
    2006
    84views more  IJMC 2006»
    Using a genetic algorithm approach to solve the dynamic channel-assignment problem
    13 years 7 months ago
    Using a genetic algorithm approach to solve the dynamic channel-assignment problem
    Download  www.cs.gsu.edu
    : The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
    Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
    claim paper
    Read More »
    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.