Sciweavers

1683 search results - page 235 / 337
» Game Theory Basics
Sort
View
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
15 years 9 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
AIMSA
2000
Springer
15 years 9 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
AIMSA
2000
Springer
15 years 9 months ago
Coverage-Based Semi-distance between Horn Clauses
In the present paper we use the approach of height functions to de ning a semi-distance measure between Horn clauses. This appraoch is already discussed elsewhere in the framework ...
Zdravko Markov, Ivo Marinchev
ADBIS
1997
Springer
109views Database» more  ADBIS 1997»
15 years 8 months ago
A Graphical Yet Formalized Framework for Specifying View Systems
A graphical formalized language is proposed for specifying systems of views over database schemas. The language is based on the notion of arrow (mapping) between data schemas and ...
Zinovy Diskin, Boris Cadish
VLDB
1992
ACM
173views Database» more  VLDB 1992»
15 years 8 months ago
An Extended Relational Database Model for Uncertain and Imprecise Information
We propose an extended relational database model which can model both uncertainty and imprecision in data. This model is basedon Dempster-Shafertheory which has become popular in ...
Suk Kyoon Lee