1772 search results - page 167 / 355 » Classifying Problems into Complexity Classes |
102
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
109
click to vote
CORR
1999
Springer
15 years 25 days ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
124
click to vote
CADE
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
161
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
121
click to vote
RSCTC
2000
Springer
15 years 4 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...