Sciweavers

    9842 search results - page 105 / 1969
    » The Complexity of the Matching-Cut Problem
    Sort
    View
    AAAI
    2012
    259views Intelligent Agents» more  AAAI 2012»
    A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
    12 years 14 days ago
    A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
    Download  fpt.akt.tu-berlin.de
    We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
    Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf ...
    claim paper
    Read More »
    CEC
    2005
    IEEE
    109views Artificial Intelligence» more  CEC 2005»
    Co-evolutionary modular neural networks for automatic problem decomposition
    14 years 1 days ago
    Co-evolutionary modular neural networks for automatic problem decomposition
    Download  www.cs.bham.ac.uk
    Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
    Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...
    claim paper
    Read More »
    IJCAI
    2007
    225views Artificial Intelligence» more  IJCAI 2007»
    Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
    13 years 11 months ago
    Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
    Download  manip.crhc.uiuc.edu
    The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
    Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...
    claim paper
    Read More »
    ECCC
    2006
    99views more  ECCC 2006»
    On the Subgroup Distance Problem
    13 years 10 months ago
    On the Subgroup Distance Problem
    Download  www.maths.qmw.ac.uk
    We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
    Christoph Buchheim, Peter J. Cameron, Taoyang Wu
    claim paper
    Read More »
    AAAI
    1993
    107views Intelligent Agents» more  AAAI 1993»
    Complexity Analysis of Real-Time Reinforcement Learning
    13 years 11 months ago
    Complexity Analysis of Real-Time Reinforcement Learning
    Download  www.ri.cmu.edu
    This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
    Sven Koenig, Reid G. Simmons
    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.