9842 search results - page 1474 / 1969 » The Complexity of the Matching-Cut Problem |
171
click to vote
CP
2005
Springer
16 years 17 days ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
200
click to vote
CSCLP
2005
Springer
16 years 17 days ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
149
click to vote
DIGRA
2005
Springer
16 years 17 days ago
2005
Springer
This paper explores the implications and uptakes of game developers’ increasing reliance on the creative labour of fan content creators. It draws on an ethnographic account of A...
176
click to vote
DIS
2005
Springer
16 years 17 days ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
184
click to vote
DSOM
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. End-to-end automated application design and deployment poses a significant technical challenge. With increasing scale and complexity of IT systems and the manual handling...