Sciweavers

Share
208 search results - page 1 / 42
» Heuristics for Dynamically Adapting Propagation
Sort
View
ECAI
2008
Springer
8 years 5 months ago
Heuristics for Dynamically Adapting Propagation
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
Kostas Stergiou
IJCNN
2000
IEEE
8 years 7 months ago
Comparison of a Heuristic Dynamic Programming and a Dual Heuristic Programming Based Adaptive Critics Neurocontroller for a Turb
: This paper presents the design of a neurocontroller for a turbogenerator that augments/replaces the conventional Automatic Voltage Regulator (AVR) and the turbine governor. The n...
Ganesh K. Venayagamoorthy, Ronald G. Harley, Donal...
CAEPIA
2003
Springer
8 years 8 months ago
A Method to Adaptively Propagate the Set of Samples Used by Particle Filters
Abstract. In recent years, particle ļ¬lters have emerged as a useful tool that enables the application of Bayesian reasoning to problems requiring dynamic state estimation. The ef...
Alvaro Soto
DCOSS
2005
Springer
8 years 5 months ago
An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...
Pierre Leone, Sotiris E. Nikoletseas, José ...
CORR
2007
Springer
147views Education» more  CORR 2007»
8 years 3 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
books