6894 search results - page 382 / 1379 » Generation Problems |
188
click to vote
ICDCS
2006
IEEE
16 years 26 days ago
2006
IEEE
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...
153
click to vote
IPPS
2006
IEEE
16 years 26 days ago
2006
IEEE
In spite of the high parallelism exhibited by cellular automata architectures, most implementations are usually run in software. For increasing execution parallelism, hardware imp...
216
click to vote
CCGRID
2008
IEEE
15 years 8 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
169
click to vote
JUCS
2008
15 years 6 months ago
2008
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
165
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...