4940 search results - page 208 / 988 » On the Complexity of Universal Programs |
150
click to vote
MICRO
2006
IEEE
16 years 14 days ago
2006
IEEE
To protect processor logic from soft errors, multicore redundant architectures execute two copies of a program on separate cores of a chip multiprocessor (CMP). Maintaining identi...
153
click to vote
WDAG
1990
Springer
15 years 10 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
159
click to vote
ISCAS
2006
IEEE
16 years 14 days ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
127
click to vote
CP
2007
Springer
16 years 19 days ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
166
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...