Sciweavers

982 search results - page 167 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Fusing a Transformation Language with an Open Compiler
Transformation systems such as Stratego/XT provide powerful analysis and transformation frameworks and concise languages for language processing, but instantiating them for every ...
Karl Trygve Kalleberg, Eelco Visser
FOCS
1998
IEEE
14 years 1 hour ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
SSS
2005
Springer
14 years 1 months ago
Synchronous vs. Asynchronous Unison
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
Christian Boulinier, Franck Petit, Vincent Villain
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
ATAL
2006
Springer
13 years 11 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo