Sciweavers

    2125 search results - page 378 / 425
    » On Graph Complexity
    Sort
    View
    TPDS
    2008
    124views more  TPDS 2008»
    Efficient Breadth-First Search on the Cell/BE Processor
    13 years 8 months ago
    Efficient Breadth-First Search on the Cell/BE Processor
    Download  domino.research.ibm.com
    Multicore processors are an architectural paradigm shift that promises a dramatic increase in performance. But, they also bring an unprecedented level of complexity in algorithmic ...
    Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
    claim paper
    Read More »
    JPDC
    2007
    191views more  JPDC 2007»
    Clustering wireless ad hoc networks with weakly connected dominating set
    13 years 8 months ago
    Clustering wireless ad hoc networks with weakly connected dominating set
    Download  anyserver.cityu.edu.hk
    The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
    Bo Han, Weijia Jia
    claim paper
    Read More »
    KBS
    2007
    56views more  KBS 2007»
    Domain-dependent distributed models for railway scheduling
    13 years 8 months ago
    Domain-dependent distributed models for railway scheduling
    Download  users.dsic.upv.es
    Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
    Miguel A. Salido, Montserrat Abril, Federico Barbe...
    claim paper
    Read More »
    IVC
    2000
    179views more  IVC 2000»
    A system to place observers on a polyhedral terrain in polynomial time
    13 years 8 months ago
    A system to place observers on a polyhedral terrain in polynomial time
    Download  vis-www.cs.umass.edu
    The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
    Maurício Marengoni, Bruce A. Draper, Allen ...
    claim paper
    Read More »
    SIAMCOMP
    2000
    104views more  SIAMCOMP 2000»
    On the Difficulty of Designing Good Classifiers
    13 years 8 months ago
    On the Difficulty of Designing Good Classifiers
    Download  www.mathcs.emory.edu
    We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
    Michelangelo Grigni, Vincent Mirelli, Christos H. ...
    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.