190 search results - page 27 / 38 » Isomorph-Free Exhaustive Generation |
109
click to vote
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
129
Voted
UML
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In Software Engineering many text-based languages and supporting tools are used, forming the grammarware technical space. Currently model driven engineering is the new em...
142
Voted
AI
1999
Springer
15 years 1 months ago
1999
Springer
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
131
Voted
IWMM
1998
Springer
15 years 6 months ago
1998
Springer
Many high-level language compilers generate C code and then invoke a C compiler for code generation. To date, most of these compilers link the resulting code against a conservativ...
112
Voted
VLDB
1997
ACM
15 years 6 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...