6740 search results - page 373 / 1348 » An s -Hamiltonian Line Graph Problem |
129
click to vote
WABI
2007
Springer
15 years 10 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
148
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
134
click to vote
KR
1994
Springer
15 years 8 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
140
click to vote
AAAI
2006
15 years 6 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
154
click to vote
JCO
2007
15 years 4 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...