13603 search results - page 234 / 2721 » On the Complexity of Computing Treelength |
156
click to vote
ICCSA
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we model an agent-based economy in which heterogeneous agents (firms and a bank) interact in the financial markets. The heterogeneity is due to the balance sheet ...
153
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
178
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
161
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper describes PI/OT, a template-based parallel I/O system. In PI/OT, I/O streams have annotations associated with them that are external to the source code. These annotatio...
149
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...