Sciweavers

314 search results - page 12 / 63
» Complete Problems for Dynamic Complexity Classes
Sort
View
PODS
2011
ACM
201views Database» more  PODS 2011»
12 years 10 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
LPAR
2010
Springer
13 years 5 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
FOCS
1998
IEEE
13 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
AAAI
2010
13 years 8 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
SIAMAM
2002
102views more  SIAMAM 2002»
13 years 7 months ago
Relaxation Oscillations in a Class of Delay Differential Equations
We study a class of delay differential equations which have been used to model hematological stem cell regulation and dynamics. Under certain circumstances the model exhibits self-...
A. C. Fowler, Michael C. Mackey