12052 search results - page 668 / 2411 » computing 2010 |
154
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
192
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
184
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Meaning can be generated when information is related at a systemic level. Such a system can be an observer, but also a discourse, for example, operationalized as a set of document...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract-- In this paper we extend the work on dynamic observers for fault diagnosis [1], [2], [3] to timed automata. We study sensor minimization problems with static observers an...
199
click to vote
FMSD
2010
15 years 5 months ago
2010
Abstract The 2009 CAV (Computer-Aided Verification) award was presented to seven individuals who made major advances in creating high-performance Boolean satisfiability solvers. ...