Sciweavers

    986 search results - page 33 / 198
    » Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
    Sort
    View
    ICML
    2009
    IEEE
    160views Machine Learning» more  ICML 2009»
    The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning
    14 years 8 months ago
    The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning
    Download  www.research.rutgers.edu
    The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
    Carlos Diuk, Lihong Li, Bethany R. Leffler
    claim paper
    Read More »
    WDAG
    2009
    Springer
    166views Algorithms» more  WDAG 2009»
    New Bounds for the Controller Problem
    14 years 2 months ago
    New Bounds for the Controller Problem
    Download  www.eng.tau.ac.il
    The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
    Yuval Emek, Amos Korman
    claim paper
    Read More »
    GECCO
    2009
    Springer
    167views Optimization» more  GECCO 2009»
    Fixed-parameter evolutionary algorithms and the vertex cover problem
    14 years 2 months ago
    Fixed-parameter evolutionary algorithms and the vertex cover problem
    Download  www.mpi-inf.mpg.de
    In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
    Stefan Kratsch, Frank Neumann
    claim paper
    Read More »
    EOR
    2008
    136views more  EOR 2008»
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    13 years 7 months ago
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    Download  theinf1.informatik.uni-jena.de
    Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
    Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
    claim paper
    Read More »
    SIROCCO
    2008
    79views Information Technology» more  SIROCCO 2008»
    On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
    13 years 9 months ago
    On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
    Download  www.cs.technion.ac.il
    In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
    Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
    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.