Sciweavers

1449 search results - page 115 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
IJCAI
2003
15 years 7 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
UAI
2003
15 years 7 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
DKE
2007
119views more  DKE 2007»
15 years 6 months ago
Association rules mining using heavy itemsets
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
Girish Keshav Palshikar, Mandar S. Kale, Manoj M. ...
ASC
2004
15 years 6 months ago
Extracting rules from trained neural network using GA for managing E-business
Theabilitytointelligentlycollect,manageandanalyzeinformationaboutcustomersandsellersisakeysourceofcompetitive advantage for an e-business. This ability provides an opportunity to ...
Atta Ebrahim E. ElAlfi, R. Haque, M. Esmel ElAlami
JAIR
2000
105views more  JAIR 2000»
15 years 6 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber