AUSAI
2015
Springer
8 years 7 months ago
2015
Springer
Probabilistic Doxastic Temporal (PDT) Logic is a formalism to represent and reason about belief evolutions in multi–agent systems. In this work we develop a theory of abduction f...
AUSAI
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. The algorithm selection problem asks to select the best algorithm for a given problem. In the companion paper Everitt and Hutter (2015b), expected BFS and DFS tree search...
AUSAI
2015
Springer
8 years 7 months ago
2015
Springer
Trust in the correctness of an election outcome requires proof of the correctness of vote counting. By formulating particular voting protocols as rules, correctness amounts to dem...
AUSAI
2015
Springer
8 years 7 months ago
2015
Springer
Answer presentation is a subtask in Question Answering that investigates the ways of presenting an acquired answer to the user in a format that is close to a human generated answer...
AUSAI
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. BFS and DFS are the two most fundamental search algorithms. We derive approximations of their expected runtimes in complete trees, as a function of tree depth and probabi...
APN
2015
Springer
8 years 7 months ago
2015
Springer
This paper investigates the feature negotiation procedure of the Datagram Congestion Control Protocol (DCCP) in RFC 4340 using Coloured Petri Nets (CPNs). After obtaining a formal ...
APN
2015
Springer
8 years 7 months ago
2015
Springer
APN
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. SIFT (Scale Invariant Feature Transform) is a complex image processing procedure for matching objects or patterns in images. Involving the computation of Euclidean distan...
APN
2015
Springer
8 years 7 months ago
2015
Springer
A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable wo...
APN
2015
Springer
8 years 7 months ago
2015
Springer
Communication structured occurrence nets (csons) are the basic variant of structured occurrence nets which have been introduced to characterise the behaviours of complex evolving s...