9842 search results - page 367 / 1969 » The Complexity of the Matching-Cut Problem |
225
click to vote
VLDB
2002
ACM
16 years 4 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
137
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
171
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
131
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
136
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...