3663 search results - page 673 / 733 » Problems in the ontology of computer programs |
LATIN
2010
Springer
14 years 8 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
PE
2010
Springer
14 years 8 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
MEMOCODE
2006
IEEE
15 years 3 months ago
2006
IEEE
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...