16404 search results - page 880 / 3281 » A set coverage problem |
187
click to vote
AIMSA
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. The problem of finding an agreement on the meaning of heterogeneous schemas is one of the key issues in the development of the Semantic Web. In this paper, we propose a ...
178
click to vote
FSTTCS
2004
Springer
16 years 1 months ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
163
click to vote
GECCO
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. Recent theoretical work helped explain certain optimizationrelated pathologies in cooperative coevolutionary algorithms (CCEAs). Such explanations have led to adopting sp...
197
click to vote
LATIN
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. We introduce distributed games over asynchronous transition systems to model a distributed controller synthesis problem. A game involves two teams and is not turn-based: ...
157
click to vote
WAOA
2004
Springer
16 years 1 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...