Sciweavers

    840 search results - page 46 / 168
    » Inapproximability of Combinatorial Optimization Problems
    Sort
    View
    SDM
    2009
    SIAM
    219views Data Mining» more  SDM 2009»
    A Hybrid Data Mining Metaheuristic for the p-Median Problem.
    14 years 8 months ago
    A Hybrid Data Mining Metaheuristic for the p-Median Problem.
    Download  www.siam.org
    Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
    Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
    claim paper
    Read More »
    FOCM
    2010
    140views more  FOCM 2010»
    Combinatorial Sublinear-Time Fourier Algorithms
    13 years 9 months ago
    Combinatorial Sublinear-Time Fourier Algorithms
    Download  www.ima.umn.edu
    We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
    Mark A. Iwen
    claim paper
    Read More »
    COMPGEOM
    2004
    ACM
    91views Discrete Geometry» more  COMPGEOM 2004»
    On lines avoiding unit balls in three dimensions
    14 years 4 months ago
    On lines avoiding unit balls in three dimensions
    Download  graphics.stanford.edu
    Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
    Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M...
    claim paper
    Read More »
    CIIA
    2009
    186views Information Technology» more  CIIA 2009»
    Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition
    14 years 2 days ago
    Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition
    Download  ftp.informatik.rwth-aachen.de
    Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
    Bilal Benmessahel, Mohamed Touahria
    claim paper
    Read More »
    PODC
    1999
    ACM
    99views Distributed and Parallel Com...» more  PODC 1999»
    Optimal, Distributed Decision-Making: The Case of no Communication
    14 years 3 months ago
    Optimal, Distributed Decision-Making: The Case of no Communication
    Download  www.cs.ucy.ac.cy
    We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
    Marios Mavronicolas, Paul G. Spirakis
    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.