Sciweavers

3946 search results - page 558 / 790
» The computational complexity of choice sets
Sort
View
CORR
2010
Springer
195views Education» more  CORR 2010»
15 years 6 months ago
Dynamic management of transactions in distributed real-time processing system
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
Y. Jayanta Singh, Yumnam Somananda Singh, Ashok Ga...
FTML
2008
185views more  FTML 2008»
15 years 6 months ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan
ESWA
2006
148views more  ESWA 2006»
15 years 6 months ago
Applications of artificial intelligence in bioinformatics: A review
Artificial intelligence (AI) has increasingly gained attention in bioinformatics research and computational molecular biology. With the availability of different types of AI algor...
Zoheir Ezziane
IJHPCA
2008
151views more  IJHPCA 2008»
15 years 6 months ago
WE-AMBLE: a Workflow Engine To Manage Awareness in Collaborative Grid Environments
Grid computing intends to share heterogeneous resources in dynamic service-based environments. This kind of systems has the major advantages of enabling rapid composition of distr...
Pilar Herrero, José Luis Bosque, Manuel Sal...
TCS
2008
15 years 6 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna