314 search results - page 23 / 63 » Complete Problems for Dynamic Complexity Classes |
156
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background:Receptors and scaffold proteins possess a number of distinct domains and bind multiple partners. A common problem in modeling signaling systems arises from a combinator...
132
click to vote
WSC
2008
15 years 8 months ago
2008
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
148
click to vote
IEAAIE
2001
Springer
15 years 10 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
196
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
119
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...