16404 search results - page 443 / 3281 » A set coverage problem |
181
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
189
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
195
click to vote
VISUALIZATION
1993
IEEE
15 years 11 months ago
1993
IEEE
Visualization has proved an e ective tool in the understanding of large data sets in computational science and engineering. There is growing interest today in the development of p...
181
click to vote
DLOG
2008
15 years 9 months ago
2008
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
132
click to vote
DAM
2006
15 years 6 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...