614 search results - page 40 / 123 » Local Computation: Lower and Upper Bounds |
152
Voted
COCO
2009
Springer
16 years 20 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
164
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
137
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
The number of probes needed by the best possible algorithm for locally or globally optimizing a bivariate function varies substantially depending on the assumptions made about the ...
174
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
166
click to vote
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...