Sciweavers

    5214 search results - page 69 / 1043
    » The Online Specialization Problem
    Sort
    View
    SIGACT
    2008
    116views more  SIGACT 2008»
    On-line bipartite matching made simple
    13 years 7 months ago
    On-line bipartite matching made simple
    Download  www.cs.washington.edu
    We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
    Benjamin E. Birnbaum, Claire Mathieu
    claim paper
    Read More »
    MFCS
    2004
    Springer
    78views Theoretical Computer Science» more  MFCS 2004»
    Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
    14 years 1 months ago
    Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
    Download  theinf1.informatik.uni-jena.de
    Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
    Rolf Niedermeier
    claim paper
    Read More »
    CP
    2006
    Springer
    121views Artificial Intelligence» more  CP 2006»
    A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
    13 years 11 months ago
    A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
    Download  www.cs.cmu.edu
    The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
    Matthew J. Streeter, Stephen F. Smith
    claim paper
    Read More »
    COLCOM
    2005
    IEEE
    191views Distributed And Parallel Com...» more  COLCOM 2005»
    Developing a framework for integrating prior problem solving and knowledge sharing histories of a group to predict future group
    14 years 1 months ago
    Developing a framework for integrating prior problem solving and knowledge sharing histories of a group to predict future group
    Download  www.immex.ucla.edu
    Using a combination of machine learning probabilistic tools, we have shown that some chemistry students fail to develop productive problem solving strategies through practice alon...
    Ron Stevens, Amy Soller, Alessandra Giordani, Luca...
    claim paper
    Read More »
    GECCO
    2007
    Springer
    190views Optimization» more  GECCO 2007»
    Analysis of evolutionary algorithms for the longest common subsequence problem
    14 years 1 months ago
    Analysis of evolutionary algorithms for the longest common subsequence problem
    Download  www.cs.bham.ac.uk
    In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
    Thomas Jansen, Dennis Weyland
    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.