2957 search results - page 88 / 592 » The Complexity of Polynomial-Time Approximation |
COCOON
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
EPIA
1993
Springer
14 years 2 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
CNSR
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
CSR
2008
Springer
13 years 12 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
ACL
2001
13 years 11 months ago
2001
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...