Sciweavers

1683 search results - page 193 / 337
» Game Theory Basics
Sort
View
DFG
2007
Springer
15 years 10 months ago
Why Interval Arithmetic is so Useful
: Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerge...
Younis Hijazi, Hans Hagen, Charles D. Hansen, Kenn...
AAAI
2006
15 years 7 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
ECIS
2003
15 years 7 months ago
Implications of constructivism for computer-based learning
Constructivism has gained popularity recently, but it is not a completely new learning paradigm. Much of the work within Information Systems Science (IS) and especially within ele...
Timo Lainema
COLING
1996
15 years 7 months ago
Discourse Semantics Meets Lexical Field Semantics
The focus of this article is the integration of two different perspectives on lexical semantics: Discourse Representation Theory's (DRT) inferentially motivated approach and ...
Beate Firzlaff, Daniela S. Kunz
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 7 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella