Sciweavers

276 search results - page 55 / 56
» The Complexity of Computing Maximal Word Functions
Sort
View
DAC
2007
ACM
14 years 7 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
13 years 11 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
SAC
2002
ACM
13 years 5 months ago
Semi-automatic design of agent organisations
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
Anthony Karageorgos, Simon G. Thompson, Nikolay Me...
VMV
2004
185views Visualization» more  VMV 2004»
13 years 7 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
ISCI
2008
159views more  ISCI 2008»
13 years 6 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao