1187 search results - page 147 / 238 » Graph-Based Procedural Abstraction |
126
click to vote
LFP
1992
15 years 3 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
106
click to vote
CONSTRAINTS
2006
15 years 1 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
135
click to vote
JUCS
2008
15 years 1 months ago
2008
: Multi-Agent Systems (MAS) constitute a well known approach in modelling dynamical real world systems. Recently, this technology has been applied to Wireless Communication Systems...
139
click to vote
CI
2011
14 years 9 months ago
2011
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
117
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...