10988 search results - page 1731 / 2198 » Algorithmic Folding Complexity |
172
click to vote
IPPS
2006
IEEE
16 years 10 days ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
187
click to vote
ISPASS
2006
IEEE
16 years 10 days ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
163
click to vote
SYNASC
2006
IEEE
16 years 10 days ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
154
click to vote
SIGECOM
2006
ACM
16 years 8 days ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
172
click to vote
SIGECOM
2006
ACM
16 years 8 days ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...