13603 search results - page 423 / 2721 » On the Complexity of Computing Treelength |
192
click to vote
ISSAC
2005
Springer
16 years 1 months ago
2005
Springer
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
193
click to vote
PROMAS
2005
Springer
16 years 1 months ago
2005
Springer
The concepts of autonomous agent and multi-agent system appropriate levels of abstraction for the design, implementation and simulation of many complex, distributed computational s...
213
click to vote
WDAG
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
208
Voted
COMPGEOM
2004
ACM
16 years 1 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
190
click to vote
ISW
2004
Springer
16 years 1 months ago
2004
Springer
We study the security challenges faced by the mobile agent paradigm, where code travels and performs computations on remote hosts in an autonomous manner. We define universally co...