Sciweavers

4926 search results - page 162 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
137
Voted
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
ICALT
2006
IEEE
15 years 11 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
TDSC
2010
172views more  TDSC 2010»
14 years 11 months ago
Proactive Detection of Computer Worms Using Model Checking
Although recent estimates are speaking of 200,000 different viruses, worms, and Trojan horses, the majority of them are variants of previously existing malware. As these variants m...
Johannes Kinder, Stefan Katzenbeisser, Christian S...
UAI
2008
15 years 6 months ago
Inference for Multiplicative Models
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
Ydo Wexler, Christopher Meek
ACSAC
2004
IEEE
15 years 8 months ago
Correlating Intrusion Events and Building Attack Scenarios Through Attack Graph Distances
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
Steven Noel, Eric Robertson, Sushil Jajodia