4940 search results - page 304 / 988 » On the Complexity of Universal Programs |
158
click to vote
SC
2000
ACM
15 years 11 months ago
2000
ACM
Parallel programmers typically assume that all resources required for a program’s execution are dedicated to that purpose. However, in local and wide area networks, contention f...
171
click to vote
ATAL
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The promise of agent-based systems is leading towards the development of autonomous, heterogeneous agents, designed by a variety of research/industrial groups and distrib...
198
click to vote
IEEEPACT
1997
IEEE
15 years 11 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
179
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
164
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...