Sciweavers

    1154 search results - page 184 / 231
    » Mathematizing C concurrency
    Sort
    View
    COMBINATORICS
    1998
    86views more  COMBINATORICS 1998»
    Lattice Tilings by Cubes: Whole, Notched and Extended
    13 years 8 months ago
    Lattice Tilings by Cubes: Whole, Notched and Extended
    Download  www.combinatorics.org
    We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
    Mihail N. Kolountzakis
    claim paper
    Read More »
    IJRR
    2002
    87views more  IJRR 2002»
    Complete Path Planning for Closed Kinematic Chains with Spherical Joints
    13 years 8 months ago
    Complete Path Planning for Closed Kinematic Chains with Spherical Joints
    Download  www.ijrr.org
    We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
    Jeffrey C. Trinkle, R. James Milgram
    claim paper
    Read More »
    HEURISTICS
    1998
    252views more  HEURISTICS 1998»
    Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
    13 years 8 months ago
    Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
    Download  reference.kfupm.edu.sa
    In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
    P. C. Chu, J. E. Beasley
    claim paper
    Read More »
    COMBINATORICS
    1999
    90views more  COMBINATORICS 1999»
    On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
    13 years 8 months ago
    On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
    Download  www.combinatorics.org
    This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
    Anna Galluccio, Martin Loebl
    claim paper
    Read More »
    MST
    1998
    76views more  MST 1998»
    Sharply Bounded Alternation and Quasilinear Time
    13 years 8 months ago
    Sharply Bounded Alternation and Quasilinear Time
    Download  home.adelphi.edu
    We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
    Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
    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.