9842 search results - page 393 / 1969 » The Complexity of the Matching-Cut Problem |
131
click to vote
ECOOP
2000
Springer
15 years 8 months ago
2000
Springer
In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We discuss some of the issues involved in copying and comp...
119
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
143
click to vote
FLAIRS
2008
15 years 6 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
122
click to vote
C3S2E
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...
134
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...