4940 search results - page 547 / 988 » On the Complexity of Universal Programs |
173
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing a...
163
click to vote
ESAW
2007
Springer
16 years 1 months ago
2007
Springer
The ubiquity of our increasingly distributed and complex computing environments have necessitated the development of programming approaches and paradigms that can automatically man...
178
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
165
click to vote
ICPR
2006
IEEE
16 years 26 days ago
2006
IEEE
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
240
click to vote
ACL2
2006
ACM
16 years 24 days ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...