4047 search results - page 626 / 810 » The Discrete Basis Problem |
123
click to vote
AI
2005
Springer
15 years 4 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
131
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
159
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
141
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
162
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...