Sciweavers

375 search results - page 6 / 75
» Making Abstract Machines Less Abstract
Sort
View
TYPES
2004
Springer
15 years 3 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
AWIC
2003
Springer
15 years 3 months ago
A Machine Learning Based Evaluation of a Negotiation between Agents Involving Fuzzy Counter-Offers
Abstract. Negotiation plays a fundamental role in systems composed of multiple autonomous agents. Some negotiations may require a more elaborated dialogue where agents would explai...
Javier Carbo Rubiera, Agapito Ledezma
ICML
2010
IEEE
14 years 8 months ago
Approximate Predictive Representations of Partially Observable Systems
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
Monica Dinculescu, Doina Precup
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
15 years 3 months ago
Rounding of Sequences and Matrices, with Applications
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
COMPUTER
2004
90views more  COMPUTER 2004»
14 years 10 months ago
Languages and the Computing Profession
highly abstracted. The Chinese writing system uses logographs--conventional representations of words or morphemes. Characters of the most common kind have two parts, one suggesting...
W. Neville Holmes