9842 search results - page 1294 / 1969 » The Complexity of the Matching-Cut Problem |
205
click to vote
FSTTCS
2004
Springer
16 years 25 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
223
click to vote
GECCO
2004
Springer
16 years 25 days ago
2004
Springer
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
217
click to vote
HYBRID
2004
Springer
16 years 25 days ago
2004
Springer
Abstract. An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achi...
187
click to vote
IEAAIE
2004
Springer
16 years 24 days ago
2004
Springer
A fundamental difficulty faced by cooperative multiagent systems is to find how to efficiently coordinate agents. There are three fundamental processes to solve the coordination pr...
207
click to vote
PRICAI
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. In this paper we address the problem of commonsense reasoning about action by appealing to Occam’s razor—we should accept the simplest hypothesis explaining the obser...