3415 search results - page 550 / 683 » Lower Bounds for Kernelizations |
166
Voted
DBPL
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
166
click to vote
IWQOS
2001
Springer
15 years 8 months ago
2001
Springer
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
130
click to vote
KI
2001
Springer
15 years 8 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
152
click to vote
STACS
2001
Springer
15 years 8 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
137
click to vote
ICCAD
2000
IEEE
15 years 8 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...