14699 search results - page 331 / 2940 » Complexity and Cognitive Computing |
167
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
166
click to vote
ICCSA
2003
Springer
15 years 12 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 ...
170
click to vote
STACS
2001
Springer
15 years 11 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...
200
click to vote
DAC
1999
ACM
15 years 11 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...
170
click to vote
IPPS
1998
IEEE
15 years 11 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...