Sciweavers

3096 search results - page 243 / 620
» The Generalized FITC Approximation
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro
COCOA
2008
Springer
15 years 7 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 7 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
IWFM
2000
112views Formal Methods» more  IWFM 2000»
15 years 7 months ago
A Note on the Relationships Between Logic Programs and Neural Networks
Several recent publications have exhibited relationships between the theories of logic programming and of neural networks. We consider a general approach to representing normal lo...
Pascal Hitzler, Anthony Karel Seda
NAACL
1994
15 years 7 months ago
Pattern Matching in a Linguistically-Motivated Text Understanding System
An ongoing debate in text understanding efforts centers on the use of pattern-matching techniques, which some have characterized as "designed to ignore as much text as possib...
Damaris M. Ayuso