Sciweavers

317 search results - page 13 / 64
» Factoring logic functions using graph partitioning
Sort
View
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 28 days ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 7 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
CORR
2006
Springer
121views Education» more  CORR 2006»
13 years 7 months ago
Loop series for discrete statistical models on graphs
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...
Michael Chertkov, Vladimir Y. Chernyak
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
CODES
2002
IEEE
14 years 21 days ago
Codesign-extended applications
We challenge the widespread assumption that an embedded system’s functionality can be captured in a single specification and then partitioned among software and custom hardware ...
Brian Grattan, Greg Stitt, Frank Vahid