Sciweavers

3341 search results - page 89 / 669
» On Bounded Queries and Approximation
Sort
View
CP
2008
Springer
14 years 11 months ago
Length-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Ho...
DMIN
2006
115views Data Mining» more  DMIN 2006»
14 years 11 months ago
Indexing Spatio-Temporal Trajectories with Orthogonal Polynomials
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
Elena Braynova
ICML
2005
IEEE
15 years 10 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
DAM
1999
132views more  DAM 1999»
14 years 9 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
15 years 11 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik