Sciweavers

3809 search results - page 576 / 762
» Randomized Broadcast in Networks
Sort
View
AAAI
1996
15 years 21 days ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
14 years 11 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
ICANN
2010
Springer
14 years 11 months ago
Solving Independent Component Analysis Contrast Functions with Particle Swarm Optimization
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
Jorge Igual, Jehad I. Ababneh, Raul Llinares, Juli...
TNN
2008
93views more  TNN 2008»
14 years 11 months ago
Towards the Optimal Design of Numerical Experiments
This paper addresses the problem of the optimal design of numerical experiments for the construction of nonlinear surrogate models. We describe a new method, called learner disagre...
S. Gazut, J.-M. Martinez, Gérard Dreyfus, Y...
NN
2002
Springer
113views Neural Networks» more  NN 2002»
14 years 11 months ago
Control of exploitation-exploration meta-parameter in reinforcement learning
In reinforcement learning (RL), the duality between exploitation and exploration has long been an important issue. This paper presents a new method that controls the balance betwe...
Shin Ishii, Wako Yoshida, Junichiro Yoshimoto