9842 search results - page 23 / 1969 » Problem complexity |
WABI
2005
Springer
14 years 1 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
AAAI
2000
13 years 9 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 5 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 9 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...