Sciweavers

2526 search results - page 200 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
ICML
2008
IEEE
16 years 4 months ago
Reinforcement learning in the presence of rare events
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
Jordan Frank, Shie Mannor, Doina Precup
INFOCOM
2002
IEEE
15 years 8 months ago
Equation-Based Packet Marking for Assured Forwarding Services
Abstract— This paper introduces a new packet marking algorithm that can be used in the context of Assured Forwarding (AF) in the Differentiated Services (DiffServ) framework [1],...
Mohamed A. El-Gendy, Kang G. Shin
126
Voted
CEC
2010
IEEE
15 years 4 months ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne
127
Voted
JCST
2008
144views more  JCST 2008»
15 years 3 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...
AFRIGRAPH
2009
ACM
15 years 7 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage