14158 search results - page 430 / 2832 » Generalized switch-setting problems |
119
click to vote
ACRI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
130
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
137
click to vote
CIAC
2010
Springer
15 years 8 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
121
click to vote
DLOG
1996
15 years 6 months ago
1996
Several significant problems exist whenapplying knowledge representation systems to real problems. In particular, the obscurity of LISP, the resource consumption, garbage collecti...
115
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...