9842 search results - page 97 / 1969 » Problem complexity |
TCS
2011
14 years 4 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
COCOON
2003
Springer
15 years 3 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
COMPULOG
1999
Springer
15 years 2 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
ENDM
2010
14 years 10 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
AI
2004
Springer
14 years 9 months ago
2004
Springer
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...