Sciweavers

620 search results - page 81 / 124
» Likelihood Computations Using Value Abstraction
Sort
View
CEEMAS
2005
Springer
14 years 3 months ago
On Communication in Solving Distributed Constraint Satisfaction Problems
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
Hyuckchul Jung, Milind Tambe
ICTCS
2005
Springer
14 years 3 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
EDBTW
2006
Springer
13 years 12 months ago
Management of Executable Schema Mappings for XML Data Exchange
Abstract. Executable schema mappings between XML schemas are essential to support numerous data management tasks such as data exchange, data integration and schema evolution. The n...
Tadeusz Pankowski
PST
2004
13 years 11 months ago
Familiarity and Trust: Measuring Familiarity with a Web Site
Abstract-- This work aims at measuring familiarity to contribute to the formalization of trust. Trust has always been bundled with familiarity to become a popular topic in the area...
Jie Zhang, Ali A. Ghorbani
GLOBECOM
2010
IEEE
13 years 8 months ago
The Information Propagation Speed Upper Bound in Cognitive Radio Networks
Abstract--The information propagation speed (IPS) of a network specifies how fast the information can be transmitted in a network. In this paper, we derive an IPS upper bound in co...
Chuan Han, Yaling Yang