7106 search results - page 287 / 1422 » Restricted Complexity, General Complexity |
121
click to vote
ACL
1998
15 years 6 months ago
1998
We present two approaches for syntactic and semantic transfer based on LFG f-structures and compare the results with existing co-description and restriction operator based approac...
164
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
139
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
130
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
134
click to vote
JDA
2008
15 years 4 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...