2492 search results - page 122 / 499 » On the General Signature Trees |
164
click to vote
ICDT
2001
ACM
15 years 11 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
209
click to vote
SPAA
1999
ACM
15 years 10 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
161
click to vote
TABLEAUX
2007
Springer
16 years 15 days ago
2007
Springer
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
198
click to vote
ROBOCUP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. An object recognition process in general is designed as a domain specific, highly specialized task. As the complexity of such a process tends to be rather inestimable, m...
164
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...