2625 search results - page 369 / 525 » The development of the Emerald programming language |
176
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
169
click to vote
LOPSTR
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...
172
click to vote
CSFW
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we develop a language of mobile agents called uPLAN for describing the capabilities of active (programmable) networks. We use a formal semantics for uPLAN to demonst...
150
click to vote
WCRE
2000
IEEE
15 years 10 months ago
2000
IEEE
Recently exchange formats have gained lots of attention. Multiple tools need to interact and/or work on the same software system. Especially there is a need to reuse parser techno...
185
click to vote
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....