9842 search results - page 1615 / 1969 » The Complexity of the Matching-Cut Problem |
171
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
174
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
220
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
184
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
Sensor networks introduce new resource allocation problems in which sensors need to be assigned to the tasks they best help. Such problems have been previously studied in simplifi...
197
Voted
DEXA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper proposes a natural extension of conditional functional dependencies (cfds [14]) and conditional inclusion dependencies (cinds [8]), denoted by cfdp s and cindp...