Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AUSAI
2015
Springer
5 years 7 months ago
Abduction in PDT Logic
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...
Karsten Martiny, Ralf Möller
AUSAI
2015
Springer
5 years 7 months ago
Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search
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...
Tom Everitt, Marcus Hutter
AUSAI
2015
Springer
5 years 7 months ago
Vote Counting as Mathematical Proof
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...
Dirk Pattinson, Carsten Schürmann
AUSAI
2015
Springer
5 years 7 months ago
Answer Presentation with Contextual Information: A Case Study Using Syntactic and Semantic Models
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...
Rivindu Perera, Parma Nand
AUSAI
2015
Springer
5 years 7 months ago
Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search
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...
Tom Everitt, Marcus Hutter
APN
2015
Springer
5 years 7 months ago
Validating DCCP Simultaneous Feature Negotiation Procedure
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 ...
Somsak Vanit-Anunchai
APN
2015
Springer
5 years 7 months ago
Applying Petri Nets to Approximation of the Euclidean Distance with the Example of SIFT
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...
Jan Henrik Röwekamp, Michael Haustermann
APN
2015
Springer
5 years 7 months ago
On Binary Words Being Petri Net Solvable
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...
Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz...
APN
2015
Springer
5 years 7 months ago
Unfolding CSPT-nets
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...
Bowen Li, Maciej Koutny
books