Sciweavers

163 search results - page 18 / 33
» Unifying Two Graph Decompositions with Modular Decomposition
Sort
View
IJCAI
2007
13 years 10 months ago
A Comparison of Time-Space Schemes for Graphical Models
We investigate three parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2) Variabl...
Robert Mateescu, Rina Dechter
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
14 years 2 months ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...
FCT
2003
Springer
14 years 1 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
13 years 8 months ago
Bartholdi Zeta Functions for Hypergraphs
Recently, Storm [8] defined the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it. We define the Bartholdi zeta function of a hypergraph, a...
Iwao Sato
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 6 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu