Sciweavers

    1272 search results - page 144 / 255
    » The Set Cover with Pairs Problem
    Sort
    View
    AAAI
    1996
    167views Intelligent Agents» more  AAAI 1996»
    Design and Implementation of a Replay Framework Based on a Partial Order Planner
    14 years 2 days ago
    Design and Implementation of a Replay Framework Based on a Partial Order Planner
    Download  rakaposhi.eas.asu.edu
    In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
    Laurie H. Ihrig, Subbarao Kambhampati
    claim paper
    Read More »
    AUTOMATICA
    2006
    140views more  AUTOMATICA 2006»
    On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
    13 years 10 months ago
    On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
    Download  www.cds.caltech.edu
    In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
    Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
    claim paper
    Read More »
    DKE
    2002
    107views more  DKE 2002»
    View selection using randomized search
    13 years 10 months ago
    View selection using randomized search
    Download  www.cs.ust.hk
    An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
    Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
    claim paper
    Read More »
    IVC
    2000
    179views more  IVC 2000»
    A system to place observers on a polyhedral terrain in polynomial time
    13 years 10 months ago
    A system to place observers on a polyhedral terrain in polynomial time
    Download  vis-www.cs.umass.edu
    The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
    Maurício Marengoni, Bruce A. Draper, Allen ...
    claim paper
    Read More »
    SIAMCOMP
    1998
    92views more  SIAMCOMP 1998»
    Surface Approximation and Geometric Partitions
    13 years 10 months ago
    Surface Approximation and Geometric Partitions
    Download  reference.kfupm.edu.sa
    Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
    Pankaj K. Agarwal, Subhash Suri
    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.