Sciweavers

2038 search results - page 289 / 408
» Probabilistic Agent Programs
Sort
View
139
Voted
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
15 years 5 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
122
Voted
TGC
2007
Springer
15 years 11 months ago
Adversaries and Information Leaks (Tutorial)
Secure information flow analysis aims to prevent programs from leaking their H (high) inputs to their L (low) outputs. A major challenge in this area is to relax the standard noni...
Geoffrey Smith
RECOMB
2003
Springer
16 years 5 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
ICRA
2006
IEEE
149views Robotics» more  ICRA 2006»
15 years 11 months ago
On Learning the Statistical Representation of a Task and Generalizing it to Various Contexts
— This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...
Sylvain Calinon, Florent Guenter, Aude Billard
IFIP
2005
Springer
15 years 10 months ago
Probable Innocence Revisited
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
Konstantinos Chatzikokolakis, Catuscia Palamidessi