Sciweavers

793 search results - page 66 / 159
» Argumentation and standards of proof
Sort
View
89
Voted
FC
2010
Springer
230views Cryptology» more  FC 2010»
15 years 4 months ago
Multiple Denominations in E-cash with Compact Transaction Data
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
Sébastien Canard, Aline Gouget
EACL
2006
ACL Anthology
15 years 2 months ago
Automatic Annotation for All Semantic Layers in FrameNet
We describe a system for automatic annotation of English text in the FrameNet standard. In addition to the conventional annotation of frame elements and their semantic roles, we a...
Richard Johansson, Pierre Nugues
111
Voted
FOIS
2006
15 years 2 months ago
A Reusable Ontology for Fluents in OWL
A critical problem for practical KR is dealing with relationships that change over time. This problem is compounded by representation languages such as OWL that are biased towards ...
Christopher A. Welty, Richard Fikes
77
Voted
PDPTA
2003
15 years 2 months ago
Java Resources for Teaching Reinforcement Learning
— In this paper we present a library of classes for programming reinforcement learning simulations in Java. This library is based upon the standard by Sutton and Santamaria [1], ...
Amy J. Kerr, Todd W. Neller, Christopher J. La Pil...
PPSN
2010
Springer
14 years 11 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt