Sciweavers

1316 search results - page 184 / 264
» Comparing mathematical models on the problem of network infe...
Sort
View
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 7 months ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana
PROCEDIA
2010
153views more  PROCEDIA 2010»
15 years 4 months ago
Conceptual framework for dynamic trust monitoring and prediction
The dynamic and collaborative nature of mobile and sensor networks raises the issue of how connected mobile devices can be trusted. Despite the existing security paradigms such as...
Olufunmilola Onolaja, Rami Bahsoon, Georgios Theod...
CORR
1998
Springer
164views Education» more  CORR 1998»
15 years 6 months ago
Training Reinforcement Neurocontrollers Using the Polytope Algorithm
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorit...
Aristidis Likas, Isaac E. Lagaris
WIOPT
2006
IEEE
16 years 12 days ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 29 days ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd