Sciweavers

1945 search results - page 203 / 389
» Pursuit-Evasion in Models of Complex Networks
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
SIGMOD
2006
ACM
123views Database» more  SIGMOD 2006»
16 years 6 months ago
Proactive identification of performance problems
We propose to demonstrate Fa, an automated tool for timely and accurate prediction of Service-Level-Agreement (SLA) violations caused by performance problems in database systems. ...
Songyun Duan, Shivnath Babu
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
16 years 5 days ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
ECSQARU
2009
Springer
16 years 1 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
16 years 1 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula