3204 search results - page 381 / 641 » The Alcuin Number of a Graph |
183
Voted
CC
2009
Springer
15 years 11 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
197
click to vote
CCGRID
2010
IEEE
15 years 4 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
175
click to vote
GD
1997
Springer
15 years 11 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
253
click to vote
OOPSLA
2000
Springer
15 years 10 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
155
click to vote
KRDB
1998
15 years 8 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...