Sciweavers

5580 search results - page 361 / 1116
» Randomized priority algorithms
Sort
View
AAAI
1994
15 years 8 months ago
An Algorithm for Probabilistic Least-Commitment Planning
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
Nicholas Kushmerick, Steve Hanks, Daniel S. Weld
UAI
1994
15 years 8 months ago
Approximation Algorithms for the Loop Cutset Problem
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
Ann Becker, Dan Geiger
ICASSP
2010
IEEE
15 years 7 months ago
Ergodic stochastic optimization algorithms for wireless communication and networking
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
Alejandro Ribeiro
GLOBECOM
2007
IEEE
15 years 7 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 7 months ago
SPOT: An R Package For Automatic and Interactive Tuning of Optimization Algorithms by Sequential Parameter Optimization
The sequential parameter optimization (spot) package for R (R Development Core Team, 2008) is a toolbox for tuning and understanding simulation and optimization algorithms. Model-...
Thomas Bartz-Beielstein