Sciweavers

6881 search results - page 91 / 1377
» Motivation
Sort
View
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 8 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
CAISE
2006
Springer
15 years 8 months ago
Goal-oriented Analysis of Regulations
This paper explains how goal-oriented requirements engineering can be transposed into regulation modelling. It motivates also why this way of modelling regulations is worthwhile fo...
Robert Darimont, Michel Lemoine
ECAI
2006
Springer
15 years 8 months ago
Imitation of Intentional Behaviour
In this paper a computational simulation of the imitation of intentional behaviour is presented. Important assumptions which make the problem computationally tractable are introduc...
Bart Jansen
ECML
2006
Springer
15 years 8 months ago
A Selective Sampling Strategy for Label Ranking
Abstract. We propose a novel active learning strategy based on the compression framework of [9] for label ranking functions which, given an input instance, predict a total order ov...
Massih-Reza Amini, Nicolas Usunier, Françoi...
RTA
1995
Springer
15 years 8 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...