514 search results - page 60 / 103 » On the Structure of Valiant's Complexity Classes |
IWANN
2005
Springer
14 years 2 months ago
2005
Springer
A large class of problems requires real-time processing of complex temporal inputs in real-time. These are difficult tasks for state-of-the-art techniques, since they require captu...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
CP
1998
Springer
14 years 29 days ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
DL
1994
Springer
14 years 25 days ago
1994
Springer
Digital Libraries will hold huge amounts of text and other forms of information. For the collections to be maximally useful, they must be highly organized with useful indexes and ...
IJCAI
1993
13 years 10 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...