9842 search results - page 415 / 1969 » The Complexity of the Matching-Cut Problem |
114
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
146
Voted
AI
2008
Springer
15 years 4 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
166
Voted
PPSN
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
144
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
149
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...