9842 search results - page 371 / 1969 » The Complexity of the Matching-Cut Problem |
158
click to vote
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
100
click to vote
ICSE
2009
IEEE-ACM
16 years 5 months ago
2009
IEEE-ACM
Developers frequently integrate complex COTS frameworks and components in software applications. COTS products are often only partially documented, and developers may misuse techn...
142
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
126
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...