1532 search results - page 232 / 307 » The Symbol Grounding Problem |
175
click to vote
ISPAN
2002
IEEE
15 years 9 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
127
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
162
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
198
click to vote
SEAAI
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. In the past, some information technologies (IT) have quickly been adopted by the engineering practice while the implementation of others has been slower. In the paper, th...
161
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...