1381 search results - page 136 / 277 » Computational Complexity of Constraint Satisfaction |
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...
119
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
134
click to vote
AAAI
2010
15 years 5 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
122
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
150
click to vote
WG
1994
Springer
15 years 8 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...