Sciweavers

2300 search results - page 357 / 460
» Maximally Concurrent Programs
Sort
View
POPL
1998
ACM
15 years 6 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
ECAI
2006
Springer
15 years 6 months ago
Learning Behaviors Models for Robot Execution Control
Robust execution of robotic tasks is a difficult problem. In many situations, these tasks involve complex behaviors combining different functionalities (e.g. perception, localizat...
Guillaume Infantes, Félix Ingrand, Malik Gh...
ECML
2006
Springer
15 years 6 months ago
Cost-Sensitive Decision Tree Learning for Forensic Classification
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
Jason V. Davis, Jungwoo Ha, Christopher J. Rossbac...
FSE
2006
Springer
117views Cryptology» more  FSE 2006»
15 years 6 months ago
How Far Can We Go on the x64 Processors?
This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on the new 64-bit x64 processors, AMD Athlon64 (AMD64) and Intel Pe...
Mitsuru Matsui
ICALP
2010
Springer
15 years 4 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...