10072 search results - page 1646 / 2015 » Composition of Model Programs |
186
click to vote
GD
2003
Springer
15 years 12 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
166
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
170
click to vote
ICTCS
2003
Springer
15 years 12 months ago
2003
Springer
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...
171
click to vote
IFIP
2003
Springer
15 years 12 months ago
2003
Springer
In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packe...
174
click to vote
IFL
2003
Springer
15 years 12 months ago
2003
Springer
Parallel programming generally requires awareness of the granularity and communication requirements of parallel subtasks, since without precaution, the overhead for parameter and r...