Sciweavers

2035 search results - page 239 / 407
» On the complexity of stratified logics
Sort
View
APCSAC
2004
IEEE
15 years 10 months ago
Dynamic Reallocation of Functional Units in Superscalar Processors
In the context of general-purpose processing, an increasing number of diverse functional units are added to cover a wide spectrum of applications. However, it is still possible to ...
Marc Epalza, Paolo Ienne, Daniel Mlynek
UAI
1997
15 years 7 months ago
Object-Oriented Bayesian Networks
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
Daphne Koller, Avi Pfeffer
CORR
2006
Springer
71views Education» more  CORR 2006»
15 years 6 months ago
Wreath Products in Stream Cipher Design
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
Vladimir Anashin
IANDC
2006
102views more  IANDC 2006»
15 years 6 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
CLUSTER
2002
IEEE
15 years 6 months ago
PHOENIX: A Self Adaptable Monitoring Platform for Cluster Management
Distributed systems based on cluster of workstation are more and more difficult to manage due to the increasing number of processors involved, and the complexity of associated appl...
Céline Boutrous-Saab, Xavier Bonnaire, Bert...