Sciweavers

    1057 search results - page 202 / 212
    » its 1998
    Sort
    View
    FIW
    1998
    130views Communications» more  FIW 1998»
    A Heuristic Approach to Detect Feature Interactions in Requirements
    13 years 8 months ago
    A Heuristic Approach to Detect Feature Interactions in Requirements
    Download  www.fb9dv.uni-duisburg.de
    We present a method to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. We show its application on the lift sy...
    Maritta Heisel, Jeanine Souquières
    claim paper
    Read More »
    FLAIRS
    1998
    132views Artificial Intelligence» more  FLAIRS 1998»
    Analytical Design of Reinforcement Learning Tasks
    13 years 8 months ago
    Analytical Design of Reinforcement Learning Tasks
    Download  www.aaai.org
    Reinforcement learning (RL) problems constitute an important class of learning and control problems faced by artificial intelligence systems. In these problems, one is faced with ...
    Robert E. Smith
    claim paper
    Read More »
    NIPS
    1998
    102views Information Technology» more  NIPS 1998»
    An Entropic Estimator for Structure Discovery
    13 years 8 months ago
    An Entropic Estimator for Structure Discovery
    Download  www.merl.com
    We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...
    Matthew Brand
    claim paper
    Read More »
    NIPS
    1998
    130views Information Technology» more  NIPS 1998»
    Modeling Surround Suppression in V1 Neurons with a Statistically Derived Normalization Model
    13 years 8 months ago
    Modeling Surround Suppression in V1 Neurons with a Statistically Derived Normalization Model
    Download  www.cns.nyu.edu
    We examine the statistics of natural monochromatic images decomposed using a multi-scale wavelet basis. Although the coefficients of this representation are nearly decorrelated, t...
    Eero P. Simoncelli, Odelia Schwartz
    claim paper
    Read More »
    SODA
    1998
    ACM
    157views Algorithms» more  SODA 1998»
    A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
    13 years 8 months ago
    A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
    Download  www.csie.ntu.edu.tw
    Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
    Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
    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.