1662 search results - page 296 / 333 » The Computational Complexity of Agent Design Problems |
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
PARA
1995
Springer
15 years 1 months ago
1995
Springer
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS . The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
155
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
103
click to vote
WSNA
2003
ACM
15 years 2 months ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
105
click to vote
ICPPW
2007
IEEE
15 years 4 months ago
2007
IEEE
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...