Sciweavers

1139 search results - page 100 / 228
» Bounded Ideation Theory
Sort
View
ATAL
2005
Springer
14 years 2 months ago
How local is that optimum? k-optimality for DCOP
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Ta...
ICFEM
2005
Springer
14 years 2 months ago
Testing Real-Time Multi Input-Output Systems
Abstract. In formal testing, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quies...
Laura Brandán Briones, Ed Brinksma
COMPGEOM
2004
ACM
14 years 2 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 1 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
RANDOM
1999
Springer
14 years 1 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav