Sciweavers

1941 search results - page 358 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CCS
2007
ACM
15 years 3 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
AOSD
2009
ACM
15 years 3 months ago
Semantic vs. syntactic compositions in aspect-oriented requirements engineering: an empirical study
Most current aspect composition mechanisms rely on syntactic references to the base modules or wildcard mechanisms quantifying over such syntactic references in pointcut expressio...
Ruzanna Chitchyan, Phil Greenwood, Américo ...
DLS
2007
150views Languages» more  DLS 2007»
15 years 3 months ago
RPython: a step towards reconciling dynamically and statically typed OO languages
Although the C-based interpreter of Python is reasonably fast, implementations on the CLI or the JVM platforms offers some advantages in terms of robustness and interoperability. ...
Davide Ancona, Massimo Ancona, Antonio Cuni, Nicho...
FASE
2009
Springer
15 years 3 months ago
Certification of Smart-Card Applications in Common Criteria
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
Iman Narasamdya, Michaël Périn
ATAL
2006
Springer
15 years 3 months ago
A context-aware approach for service selection using ontologies
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
Murat Sensoy, Pinar Yolum