Sciweavers

7106 search results - page 451 / 1422
» Restricted Complexity, General Complexity
Sort
View
LPAR
2004
Springer
16 years 1 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
MATA
2004
Springer
16 years 1 months ago
Distributed Shared Contexts
Mobile solutions have gone beyond the role of personal tool to offer solutions in supporting coordinated work. Mobile workers shift constantly from individual to group work, access...
Rosa Alarcón, César A. Collazos, Lui...
SPATIALCOGNITION
2004
Springer
16 years 1 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
STACS
2004
Springer
16 years 1 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
WG
2004
Springer
16 years 1 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji