5100 search results - page 658 / 1020 » The Linear Complexity of a Graph |
171
click to vote
CIDR
2009
15 years 7 months ago
2009
Enterprise environments have isolated teams responsible separately for database management and the management of underlying networkattached server-storage infrastructure (referred...
167
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
212
Voted
AI
2010
Springer
15 years 6 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...
199
click to vote
CGF
2008
15 years 6 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...
197
click to vote
CORR
2010
Springer
15 years 6 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...