1484 search results - page 212 / 297 » Ants meeting algorithms |
VLSID
2005
IEEE
15 years 10 months ago
2005
IEEE
An important application of dynamically and partially reconfigurable computing platforms is in dynamic task allocation and execution. On-line synthesis, on-line placement and on-l...
107
click to vote
PODS
2001
ACM
15 years 10 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
ICWS
2009
IEEE
15 years 7 months ago
2009
IEEE
Algorithms for composing Web services (WS) traditionally utilize the functional and quality-of-service parameters of candidate services to decide which services to include in the ...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...