Sciweavers

32 search results - page 6 / 7
» Bounding Performance Loss in Approximate MDP Homomorphisms
Sort
View
PODS
2003
ACM
132views Database» more  PODS 2003»
14 years 4 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
USENIX
1994
13 years 6 months ago
A Better Update Policy
y-filled data block results in a delayed write,Abstract while a modification that fills a block results in an immediate, although asynchronous, write. TheSome file systems can dela...
Jeffrey C. Mogul
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
13 years 10 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
COMSWARE
2007
IEEE
13 years 8 months ago
Efficient Design of End-to-End Probes for Source-Routed Networks
Migration to a converged network has caused service providers to deploy real time applications such as voice over an IP (VoIP) network. From the provider's perspective, the s...
Srinivasan Parthasarathya, Rajeev Rastogi, Marina ...
SI3D
1999
ACM
13 years 9 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha