Sciweavers

    1493 search results - page 30 / 299
    » Local resilience of graphs
    Sort
    View
    ICML
    2005
    IEEE
    99views Machine Learning» more  ICML 2005»
    Identifying useful subgoals in reinforcement learning by local graph partitioning
    14 years 8 months ago
    Identifying useful subgoals in reinforcement learning by local graph partitioning
    Download  www-anw.cs.umass.edu
    We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
    Özgür Simsek, Alicia P. Wolfe, Andrew G....
    claim paper
    Read More »
    KDD
    2008
    ACM
    123views Data Mining» more  KDD 2008»
    Efficient semi-streaming algorithms for local triangle counting in massive graphs
    14 years 8 months ago
    Efficient semi-streaming algorithms for local triangle counting in massive graphs
    Download  www.chato.cl
    Luca Becchetti, Paolo Boldi, Carlos Castillo, Aris...
    claim paper
    Read More »
    COMPGEOM
    2004
    ACM
    132views Discrete Geometry» more  COMPGEOM 2004»
    On locally Delaunay geometric graphs
    14 years 1 months ago
    On locally Delaunay geometric graphs
    Download  www.mpi-inf.mpg.de
    A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
    Rom Pinchasi, Shakhar Smorodinsky
    claim paper
    Read More »
    SOICT
    2010
    146views Information Technology» more  SOICT 2010»
    Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
    13 years 2 months ago
    Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
    Download  becool.info.ucl.ac.be
    Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
    Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
    claim paper
    Read More »
    ALENEX
    2007
    102views Algorithms» more  ALENEX 2007»
    Linearization: Locally Self-Stabilizing Sorting in Graphs
    13 years 9 months ago
    Linearization: Locally Self-Stabilizing Sorting in Graphs
    Download  www14.in.tum.de
    We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
    Melih Onus, Andréa W. Richa, Christian Sche...
    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.