Sciweavers

2412 search results - page 456 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ATAL
2006
Springer
13 years 11 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
ATAL
2008
Springer
13 years 9 months ago
Resource limitations, transmission costs and critical thresholds in scale-free networks
Whether or not a critical threshold exists when epidemic diseases are spread in complex networks is a problem attracting attention from researchers in several disciplines. In 2001...
Chung-Yuan Huang, Chuen-Tsai Sun, Chia-Ying Cheng,...
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
CORR
2008
Springer
170views Education» more  CORR 2008»
13 years 7 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
Sudhir Kumar Singh, Vwani P. Roychowdhury
BMCBI
2007
173views more  BMCBI 2007»
13 years 7 months ago
Recursive Cluster Elimination (RCE) for classification and feature selection from gene expression data
Background: Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that a...
Malik Yousef, Segun Jung, Louise C. Showe, Michael...