8298 search results - page 1644 / 1660 » On the Complexity of Numerical Analysis |
RTAS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
SIMPRA
2010
13 years 5 months ago
2010
In this paper we derive the singularity-free dynamic equations of vehiclemanipulator systems using a minimal representation. These systems are normally modeled using Euler angles,...
STVR
2010
13 years 5 months ago
2010
Failures triggered by hard to debug defects usually involve complex interactions between many program elements. We hypothesize that information flows present a good model for such ...