Sciweavers

    1199 search results - page 157 / 240
    » Parameterized Proof Complexity
    Sort
    View
    IS
    2007
    106views Artificial Intelligence» more  IS 2007»
    Semantic optimization techniques for preference queries
    13 years 8 months ago
    Semantic optimization techniques for preference queries
    Download  www.cse.buffalo.edu
    Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
    Jan Chomicki
    claim paper
    Read More »
    TSP
    2008
    92views more  TSP 2008»
    Distributed Structures, Sequential Optimization, and Quantization for Detection
    13 years 8 months ago
    Distributed Structures, Sequential Optimization, and Quantization for Detection
    Download  www.ece.rice.edu
    Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
    Michael A. Lexa, Don H. Johnson
    claim paper
    Read More »
    ALGORITHMICA
    2002
    93views more  ALGORITHMICA 2002»
    Improved Algorithms for Uniform Partitions of Points
    13 years 8 months ago
    Improved Algorithms for Uniform Partitions of Points
    Download  www.cse.iitd.ernet.in
    We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
    Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
    claim paper
    Read More »
    IPL
    2002
    65views more  IPL 2002»
    Parallel evolutionary algorithms can achieve super-linear performance
    13 years 8 months ago
    Parallel evolutionary algorithms can achieve super-linear performance
    Download  www.lcc.uma.es
    One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
    Enrique Alba
    claim paper
    Read More »
    TPDS
    2002
    126views more  TPDS 2002»
    P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
    13 years 8 months ago
    P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
    Download  www.science.uva.nl
    One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
    Frank J. Seinstra, Dennis Koelma
    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.