1254 search results - page 2 / 251 » Making Hard Problems Harder |
129
Voted
CORR
2007
Springer
14 years 10 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
67
Voted
KR
2000
Springer
15 years 1 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
80
Voted
ISSTA
2006
ACM
2006
ACM
Architecture-driven platform independent deterministic replay for distributed hard real-time systems
15 years 4 months ago
Distributed hard real-time systems have become a major component of many advanced technical products. Means to ensure their proper quality are thus of paramount importance. To ens...
100
Voted
HPCN
1997
Springer
15 years 2 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
78
Voted
EVOW
2004
Springer
15 years 2 months ago
2004
Springer
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may l...