1205 search results - page 218 / 241 » On P Systems with Bounded Parallelism |
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
CIKM
2004
Springer
14 years 28 days ago
2004
Springer
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...