896 search results - page 126 / 180 » On completeness of word reversing |
SWAT
1998
Springer
15 years 4 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
WG
1998
Springer
15 years 4 months ago
1998
Springer
The number of triangles in arrangements of lines and pseudolines has been object of some research. Most results, however, concern arrangements in the projective plane. In this arti...
STOC
1997
ACM
15 years 4 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
112
click to vote
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...