15033 search results - page 2577 / 3007 » Complexity Theory and Algorithms |
177
click to vote
FOCS
2006
IEEE
16 years 28 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
186
Voted
IPPS
2006
IEEE
16 years 27 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...
213
click to vote
ISPASS
2006
IEEE
16 years 26 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...
183
Voted
SYNASC
2006
IEEE
16 years 26 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...
207
Voted
VALUETOOLS
2006
ACM
16 years 24 days ago
2006
ACM
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...