1844 search results - page 223 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
160
Voted
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
209
Voted
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
149
Voted
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
158
click to vote
CP
2007
Springer
16 years 9 days ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
154
click to vote
CEC
2008
IEEE
16 years 19 days ago
2008
IEEE
Abstract—While scalarization approaches to multicriteria optimization become infeasible in the case of many objectives, for few objectives the benefits of populationbased method...