Sciweavers

15073 search results - page 362 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
15 years 9 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
PLDI
1994
ACM
15 years 9 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 8 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
IJCAI
2003
15 years 6 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. ...
ECCV
2008
Springer
16 years 7 months ago
Constrained Maximum Likelihood Learning of Bayesian Networks for Facial Action Recognition
Probabilistic graphical models such as Bayesian Networks have been increasingly applied to many computer vision problems. Accuracy of inferences in such models depends on the quali...
Cassio Polpo de Campos, Yan Tong, Qiang Ji