Sciweavers

    IJCAI
    2001
    151views Artificial Intelligence» more  IJCAI 2001»
    R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
    13 years 11 months ago
    R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
    Download  jmlr.csail.mit.edu
    R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
    Ronen I. Brafman, Moshe Tennenholtz
    claim paper
    Read More »
    DICTA
    2003
    81views Applied Computing» more  DICTA 2003»
    Diamond, Hexagon, and General Polygonal Shaped Window Smoothing
    13 years 11 months ago
    Diamond, Hexagon, and General Polygonal Shaped Window Smoothing
    Download  www.aprs.org.au
    Abstract. This paper presents fast recursive or moving windows algorithms for calculating local means in a diamond, hexagon and general polygonal shaped windows of an image. The al...
    Changming Sun
    claim paper
    Read More »
    ISCAPDCS
    2004
    75views Distributed And Parallel Com...» more  ISCAPDCS 2004»
    Randomized Sorting on the POPS Network
    13 years 11 months ago
    Randomized Sorting on the POPS Network
    Download  www.engr.uconn.edu
    Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
    Jaime Davila, Sanguthevar Rajasekaran
    claim paper
    Read More »
    IJIT
    2004
    200views Artificial Intelligence» more  IJIT 2004»
    A Fuzzy Classifier with Evolutionary Design of Ellipsoidal Decision Regions
    13 years 11 months ago
    A Fuzzy Classifier with Evolutionary Design of Ellipsoidal Decision Regions
    Download  www.waset.org
    A fuzzy classifier using multiple ellipsoids approximating decision regions for classification is to be designed in this paper. An algorithm called Gustafson-Kessel algorithm (GKA)...
    Leehter Yao, Kuei-Song Weng, Cherng-Dir Huang
    claim paper
    Read More »
    ICISC
    2004
    120views Cryptology» more  ICISC 2004»
    Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
    13 years 11 months ago
    Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
    Download  www.isical.ac.in
    Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
    Sanjit Chatterjee, Palash Sarkar, Rana Barua
    claim paper
    Read More »
    APPINF
    2003
    225views Information Technology» more  APPINF 2003»
    Fast Frequent Itemset Mining using Compressed Data Representation
    13 years 11 months ago
    Fast Frequent Itemset Mining using Compressed Data Representation
    Download  www.computing.edu.au
    Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
    Raj P. Gopalan, Yudho Giri Sucahyo
    claim paper
    Read More »
    ACL
    2003
    87views Computational Linguistics» more  ACL 2003»
    Discourse Segmentation of Multi-Party Conversation
    13 years 11 months ago
    Discourse Segmentation of Multi-Party Conversation
    Download  acl.ldc.upenn.edu
    We present a domain-independent topic segmentation algorithm for multi-party speech. Our feature-based algorithm combines knowledge about content using a text-based algorithm as a...
    Michel Galley, Kathleen McKeown, Eric Fosler-Lussi...
    claim paper
    Read More »
    FLAIRS
    2006
    103views Artificial Intelligence» more  FLAIRS 2006»
    Model Construction Algorithms for Object-Oriented Probabilistic Relational Models
    13 years 11 months ago
    Model Construction Algorithms for Object-Oriented Probabilistic Relational Models
    Download  www.aaai.org
    This paper presents three new algorithms for the automatic construction of models from Object Oriented Probabilistic RelationalModels. The first two algorithms are based on the kn...
    Catherine Howard, Markus Stumptner
    claim paper
    Read More »
    FLAIRS
    2006
    133views Artificial Intelligence» more  FLAIRS 2006»
    Which Dynamic Constraint Problems Can Be Solved By Ants?
    13 years 11 months ago
    Which Dynamic Constraint Problems Can Be Solved By Ants?
    Download  www.aaai.org
    There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
    Koenraad Mertens, Tom Holvoet, Yolande Berbers
    claim paper
    Read More »
    FCS
    2006
    153views Computer Science» more  FCS 2006»
    Algorithmic Control in Concurrent Computations
    13 years 11 months ago
    Algorithmic Control in Concurrent Computations
    Download  ww1.ucmss.com
    : In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
    Mark Burgin
    claim paper
    Read More »
    « first‹ previous…176177178179180181182183184…next ›last »
    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.