We introduce a proposal to give argumentation capacity to databases. A database is said to have argumentation capacity if it can extract from the information available to it a set ...
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Abstract. This paper presents the semantics of database mappings in the relational database (DB) category, based on the power-view monad T and monadic algebras. The semantics can b...
—This paper deals with optimized training sequences to estimate multiple-input multiple-output orthogonal frequencydivision multiplexing (MIMO-OFDM) channel states in the presenc...