Sciweavers

    164 search results - page 5 / 33
    » Balanced Interval Coloring
    Sort
    View
    IWIA
    2006
    IEEE
    135views Information Technology» more  IWIA 2006»
    Modeling and Execution of Complex Attack Scenarios using Interval Timed Colored Petri Nets
    15 years 3 months ago
    Modeling and Execution of Complex Attack Scenarios using Interval Timed Colored Petri Nets
    Download  www.wolthusen.com
    The commonly used flaw hypothesis model (FHM) for performing penetration tests provides only limited, highlevel guidance for the derivation of actual penetration attempts. In thi...
    Ole Martin Dahl, Stephen D. Wolthusen
    claim paper
    Read More »
    ISAAC
    2010
    Springer
    265views Algorithms» more  ISAAC 2010»
    On the Approximability of the Maximum Interval Constrained Coloring Problem
    14 years 7 months ago
    On the Approximability of the Maximum Interval Constrained Coloring Problem
    Download  www.mpi-inf.mpg.de
    Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
    claim paper
    Read More »
    TECS
    2010
    68views more  TECS 2010»
    Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs
    14 years 4 months ago
    Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs
    Download  www.cse.unsw.edu.au
    Lian Li 0002, Jingling Xue, Jens Knoop
    claim paper
    Read More »
    PODC
    2004
    ACM
    246views Distributed And Parallel Com...» more  PODC 2004»
    Balanced binary trees for ID management and load balance in distributed hash tables
    15 years 3 months ago
    Balanced binary trees for ID management and load balance in distributed hash tables
    Download  infolab.stanford.edu
    We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
    Gurmeet Singh Manku
    claim paper
    Read More »
    COCOON
    2009
    Springer
    96views Combinatorics» more  COCOON 2009»
    A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
    15 years 4 months ago
    A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
    Download  www.dais.is.tohoku.ac.jp
    We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
    Akiyoshi Shioura, Mutsunori Yagiura
    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-2025, USA.