9842 search results - page 16 / 1969 » The Complexity of the Matching-Cut Problem |
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
AAAI
2000
13 years 8 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
IJFCS
2008
13 years 7 months ago
2008
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
ENDM
2010
13 years 4 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
IJCAI
2003
13 years 8 months ago
2003
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...