Sciweavers

    125 search results - page 15 / 25
    » An Optimization Problem Related to Minkowski's Successive Mi...
    Sort
    View
    EOR
    2006
    135views more  EOR 2006»
    Principles of scatter search
    13 years 7 months ago
    Principles of scatter search
    Download  www.uv.es
    Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
    Rafael Martí, Manuel Laguna, Fred Glover
    claim paper
    Read More »
    COMPGEOM
    2006
    ACM
    87views Discrete Geometry» more  COMPGEOM 2006»
    On the ICP algorithm
    13 years 9 months ago
    On the ICP algorithm
    Download  eurocg.org
    We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
    Esther Ezra, Micha Sharir, Alon Efrat
    claim paper
    Read More »
    KDD
    2012
    ACM
    207views Data Mining» more  KDD 2012»
    Robust multi-task feature learning
    11 years 10 months ago
    Robust multi-task feature learning
    Download  www.public.asu.edu
    Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
    Pinghua Gong, Jieping Ye, Changshui Zhang
    claim paper
    Read More »
    DAC
    2006
    ACM
    107views Computer Architecture» more  DAC 2006»
    Efficient SAT-based Boolean matching for FPGA technology mapping
    14 years 8 months ago
    Efficient SAT-based Boolean matching for FPGA technology mapping
    Download  www.eecg.utoronto.ca
    Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
    Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
    claim paper
    Read More »
    DAM
    2006
    132views more  DAM 2006»
    On the combinatorial structure of chromatic scheduling polytopes
    13 years 7 months ago
    On the combinatorial structure of chromatic scheduling polytopes
    Download  www.math.uni-magdeburg.de
    Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
    Javier Marenco, Annegret Wagler
    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.