Sciweavers

868 search results - page 17 / 174
» Finding Most Likely Solutions
Sort
View
AAAI
2006
13 years 9 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
ISLPED
2006
ACM
145views Hardware» more  ISLPED 2006»
14 years 1 months ago
An optimal analytical solution for processor speed control with thermal constraints
As semiconductor manufacturing technology scales to smaller device sizes, the power consumption of clocked digital ICs begins to increase. Dynamic voltage and frequency scaling (D...
Ravishankar Rao, Sarma B. K. Vrudhula, Chaitali Ch...
AIPS
2010
13 years 10 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
13 years 11 months ago
Growth of self-canceling code in evolutionary systems
This research examines the behavior of inoperative code (introns) in the evolution of genetically robust solutions. Genetically robust solutions are solutions that are less likely...
Xue Zhong, Terence Soule
CEC
2007
IEEE
13 years 11 months ago
A multi-layered solution for supporting isp traffic demand using genetic algorithm
This paper proposes a unique feedback governed multi layered architectural model to support ISP's traffic demands with multiple Quality of Service(QoS) constraints. The propos...
Gajaruban Kandavanam, Dmitri Botvich, Sasitharan B...