Sciweavers

7930 search results - page 1174 / 1586
» Greedy in Approximation Algorithms
Sort
View
UAI
2004
15 years 8 months ago
Hybrid Influence Diagrams Using Mixtures of Truncated Exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
Barry R. Cobb, Prakash P. Shenoy
UAI
2004
15 years 8 months ago
Blind Construction of Optimal Nonlinear Recursive Predictors for Discrete Sequences
We present a new method for nonlinear prediction of discrete random sequences under minimal structural assumptions. We give a mathematical construction for optimal predictors of s...
Cosma Rohilla Shalizi, Kristina Lisa Shalizi
WSC
2004
15 years 8 months ago
On Using Monte Carlo Methods for Scheduling
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...
Samarn Chantaravarapan, Ali K. Gunal, Edward J. Wi...
WSC
2004
15 years 8 months ago
Exploiting Temporal Uncertainty in Process-Oriented Distributed Simulations
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...
Margaret L. Loper, Richard M. Fujimoto
AAAI
1997
15 years 8 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
« Prev « First page 1174 / 1586 Last » Next »