285 search results - page 27 / 57 » The complexity of soft constraint satisfaction |
155
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
168
click to vote
RTSS
2003
IEEE
15 years 11 months ago
2003
IEEE
Real-time systems are growing in complexity and realtime and soft real-time applications are becoming common in general-purpose computing environments. Thus, there is a growing ne...
165
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
146
click to vote
IJCAI
1993
15 years 7 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
171
click to vote
RTSS
2000
IEEE
15 years 9 months ago
2000
IEEE
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...