2503 search results - page 436 / 501 » A study of 3-arc graphs |
GECCO
2008
Springer
13 years 8 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...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper a large amount of absolute mean opinion scores obtained within a single listening test are presented. Naïve listeners’ preference on different speech signal prope...
AI
2010
Springer
13 years 7 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...
CORR
2010
Springer
13 years 7 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...