4940 search results - page 311 / 988 » On the Complexity of Universal Programs |
189
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
152
click to vote
APPT
2003
Springer
15 years 12 months ago
2003
Springer
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
199
click to vote
JAR
2007
15 years 6 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
170
Voted
FOCS
1989
IEEE
15 years 10 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
175
click to vote
POPL
1995
ACM
15 years 10 months ago
1995
ACM
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations eve...