Sciweavers

    1208 search results - page 215 / 242
    » On Counting Generalized Colorings
    Sort
    View
    IJFCS
    2006
    58views more  IJFCS 2006»
    Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis
    13 years 9 months ago
    Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis
    Download  www.cs.toronto.edu
    Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the ...
    Yuli Ye, Janusz A. Brzozowski
    claim paper
    Read More »
    JAIR
    2008
    171views more  JAIR 2008»
    AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
    13 years 9 months ago
    AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
    Download  www.ics.uci.edu
    Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
    Robert Mateescu, Rina Dechter, Radu Marinescu 0002
    claim paper
    Read More »
    JCIT
    2008
    138views more  JCIT 2008»
    Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
    13 years 9 months ago
    Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
    Download  www.aicit.org
    Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
    B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
    claim paper
    Read More »
    JCST
    2008
    175views more  JCST 2008»
    Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
    13 years 9 months ago
    Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
    Download  www.ccf.org.cn
    Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
    Hong Shen, Yu Zhang
    claim paper
    Read More »
    CORR
    2007
    Springer
    167views Education» more  CORR 2007»
    Approximation Algorithms for Orienteering with Time Windows
    13 years 9 months ago
    Approximation Algorithms for Orienteering with Time Windows
    Download  www.cs.uiuc.edu
    Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
    Chandra Chekuri, Nitish Korula
    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.