Sciweavers

1101 search results - page 138 / 221
» Forcing in proof theory
Sort
View
119
Voted
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
15 years 7 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
147
Voted
DAGM
2009
Springer
15 years 7 months ago
Quantitative Assessment of Image Segmentation Quality by Random Walk Relaxation Times
The purpose of image segmentation is to partition the pixel grid of an image into connected components termed segments such that (i) each segment is homogenous and (ii) for any pai...
Björn Andres, Ullrich Köthe, Andreea Bon...
IAT
2008
IEEE
15 years 7 months ago
Formalizing Multi-state Learning Dynamics
This paper extends the link between evolutionary game theory and multi-agent reinforcement learning to multistate games. In previous work, we introduced piecewise replicator dynam...
Daniel Hennes, Karl Tuyls, Matthias Rauterberg
115
Voted
LICS
2008
IEEE
15 years 7 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
ICTAI
2007
IEEE
15 years 7 months ago
CompoNet: Programmatically Embedding Neural Networks into AI Applications as Software Components
The provision of embedding neural networks into software applications can enable variety of Artificial Intelligence systems for individual users as well as organizations. Previous...
Uzair Ahmad, Andrey Gavrilov, Sungyoung Lee, Young...