3946 search results - page 437 / 790 » The computational complexity of choice sets |
168
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
178
click to vote
HPCA
1996
IEEE
15 years 11 months ago
1996
IEEE
Exploiting instruction-level parallelism (ILP) is extremely important for achieving high performance in application specific instruction set processors (ASIPs) and embedded process...
182
click to vote
ICPADS
1996
IEEE
15 years 11 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
195
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
This paper discusses the design of a chip using architectural synthesis. The chip, FADIC, is applied in Digital Audio Broadcasting (DAB) receivers. It shows that architectural syn...
185
click to vote
SC
1993
ACM
15 years 11 months ago
1993
ACM
Simulation of complex 3-dimensional phenomena generate data sets which are hard to comprehend using conventional 2-dimensionally oriented visualization tools. One way to overcome ...