9842 search results - page 326 / 1969 » The Complexity of the Matching-Cut Problem |
124
click to vote
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents an approach for reasoning about action and change which appeals to the principle of Occam’s razor— roughly stating that the simplest explanations ...
101
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper shows how the presence of states in test objects can hinder or render impossible the search for test data using evolutionary testing. Additional guidance is re...
111
click to vote
COMPSAC
2002
IEEE
15 years 9 months ago
2002
IEEE
Maintenance is undoubtedly the most effort-consuming activity in software production whereby the entropy of legacy systems (e.g., due to redundancies, poor modularity and lack of ...
150
click to vote
CSR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
120
click to vote
RT
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...