4940 search results - page 363 / 988 » On the Complexity of Universal Programs |
182
click to vote
AICCSA
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
182
click to vote
IPPS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...
165
click to vote
LCPC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...
137
click to vote
WSC
2008
2008
Optimizing staffing schedule in light of patient satisfaction for the whole outpatient hospital ward
15 years 9 months ago
The waiting time for patients in outpatient departments of hospitals is a problem throughout the world. In this context, a discrete-event-simulation model was developed to examine...
187
click to vote
ICAISC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Multigame playing agents are programs capable of autonomously learning to play new, previously unknown games. In this paper, we concentrate on the General Game Playing Co...