270 search results - page 11 / 54 » Dynamic Complexity Theory Revisited |
CN
2004
14 years 11 months ago
2004
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...
DBPL
2007
Springer
15 years 5 months ago
2007
Springer
Transforming relational data into XML, as known as XML publishing, is often necessary when one wants to exchange data residing in databases or to create an XML interface of a tradi...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
IJCM
2010
14 years 10 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
133
click to vote
AI
2011
Springer
14 years 6 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...