9842 search results - page 277 / 1969 » The Complexity of the Matching-Cut Problem |
114
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
107
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
ALT
2003
Springer
15 years 9 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
73
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is s...