1736 search results - page 252 / 348 » The rank-width of Directed Graphs |
167
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
161
click to vote
CGF
2008
15 years 4 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
154
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
139
click to vote
CONSTRAINTS
2008
15 years 4 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
136
click to vote
CSDA
2010
15 years 4 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...