Sciweavers

2326 search results - page 277 / 466
» Discovering significant patterns
Sort
View
TDSC
2008
83views more  TDSC 2008»
15 years 6 months ago
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...
T. Y. Wong, Man Hon Wong, John C. S. Lui
TMC
2008
90views more  TMC 2008»
15 years 6 months ago
Trust-Based Fast Authentication for Multiowner Wireless Networks
In multiowner wireless networks, access points (APs) are owned and operated by different administrations, leading to significant authentication delays during handoff between APs. W...
Jahan Hassan, Harsha Sirisena, Björn Landfeld...
TSMC
2008
229views more  TSMC 2008»
15 years 6 months ago
A Comprehensive Survey of Multiagent Reinforcement Learning
Multiagent systems are rapidly finding applications in a variety of domains, including robotics, distributed control, telecommunications, and economics. The complexity of many task...
Lucian Busoniu, Robert Babuska, Bart De Schutter
IDA
2000
Springer
15 years 6 months ago
Reducing redundancy in characteristic rule discovery by using integer programming techniques
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
Tom Brijs, Koen Vanhoof, Geert Wets
IAT
2010
IEEE
15 years 4 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler