Sciweavers

373 search results - page 22 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
CRV
2009
IEEE
153views Robotics» more  CRV 2009»
15 years 9 months ago
Optimal Online Data Sampling or How to Hire the Best Secretaries
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
Yogesh Girdhar, Gregory Dudek
EUC
2006
Springer
15 years 6 months ago
Efficent Algorithm of Energy Minimization for Heterogeneous Wireless Sensor Network
Abstract. Energy and delay are critical issues for wireless sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Due to the u...
Mei Kang Qiu, Chun Xue, Zili Shao, Qingfeng Zhuge,...
FOGA
1998
15 years 4 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal
ICML
2010
IEEE
15 years 4 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
IAT
2006
IEEE
15 years 9 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler