3946 search results - page 682 / 790 » The computational complexity of choice sets |
169
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
160
click to vote
IJCGA
2007
15 years 6 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
196
click to vote
IJNSEC
2007
15 years 6 months ago
2007
Large scale distributed applications combine network access with multiple storage and computational elements. The distributed responsibility for resource control creates new secur...
182
click to vote
TCAD
2008
15 years 6 months ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
165
click to vote
TCS
2008
15 years 6 months ago
2008
Temporal logics and model-checking have proved successful to respectively express biological properties of complex biochemical systems, and automatically verify their satisfaction...