4940 search results - page 158 / 988 » On the Complexity of Universal Programs |
146
Voted
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— We explore the use of computational optimal control techniques for automated construction of policies in complex dynamic environments. Our implementation of dynamic programming...
126
Voted
WSC
1998
15 years 6 months ago
1998
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
155
click to vote
IJFCS
2006
15 years 5 months ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
115
click to vote
COCO
2003
Springer
15 years 10 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
123
Voted
ESEM
2009
ACM
15 years 11 months ago
2009
ACM
Software development is a complex and error-prone task. An important factor during the development of complex systems is the understanding of the dependencies that exist between d...