Sciweavers

920 search results - page 76 / 184
» Generating Satisfiable Problem Instances
Sort
View
ITSSA
2006
100views more  ITSSA 2006»
13 years 10 months ago
A General Framework for Multi-agent Search with Individual and Global Goals: Stakeholder Search
: Stakeholder search is a general framework for an extension to the improving on the competition approach paradigm for cooperative search that allows for additional individual goal...
Alan Fedoruk, Jörg Denzinger
EDBT
2008
ACM
162views Database» more  EDBT 2008»
14 years 11 months ago
Schema merging and mapping creation for relational sources
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
Rachel Pottinger, Philip A. Bernstein
CSCLP
2004
Springer
14 years 4 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
EVOW
2005
Springer
14 years 4 months ago
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
István Juhos, Attila Tóth, Jano I. v...
ARSCOM
2008
117views more  ARSCOM 2008»
13 years 11 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner