Sciweavers

    1983 search results - page 369 / 397
    » Competitive graph searches
    Sort
    View
    TKDE
    2008
    134views more  TKDE 2008»
    Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
    13 years 7 months ago
    Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
    Download  www.spatial.cs.umn.edu
    Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
    Sangho Kim, Shashi Shekhar, Manki Min
    claim paper
    Read More »
    KBS
    2007
    56views more  KBS 2007»
    Domain-dependent distributed models for railway scheduling
    13 years 7 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 »
    CIKM
    2010
    Springer
    148views Information Technology» more  CIKM 2010»
    Rank learning for factoid question answering with linguistic and semantic constraints
    13 years 6 months ago
    Rank learning for factoid question answering with linguistic and semantic constraints
    Download  www.cs.cmu.edu
    This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
    Matthew W. Bilotti, Jonathan L. Elsas, Jaime G. Ca...
    claim paper
    Read More »
    4OR
    2010
    148views more  4OR 2010»
    Point-to-point shortest paths on dynamic time-dependent road networks
    13 years 6 months ago
    Point-to-point shortest paths on dynamic time-dependent road networks
    Download  www.lix.polytechnique.fr
    This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
    Giacomo Nannicini
    claim paper
    Read More »
    IAT
    2010
    IEEE
    141views Intelligent Agents» more  IAT 2010»
    Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
    13 years 5 months ago
    Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
    Download  www.personal.utulsa.edu
    Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
    Melanie Smith, Roger Mailler
    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.