10988 search results - page 1987 / 2198 » Algorithmic Folding Complexity |
139
click to vote
ICRA
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
138
Voted
ICWS
2009
IEEE
15 years 1 months ago
2009
IEEE
We present a Semantic Optimized Service Discovery (SemOSD) approach capable of handling Web service search requests on a fine-grained level of detail where we augment semantic ser...
141
Voted
IEEEPACT
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--Chip-MultiProcessor (CMP) architectures are becoming more and more popular as an alternative to the traditional processors that only extract instruction-level parallelism...
144
Voted
CC
2010
Springer
15 years 1 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
126
click to vote
CORR
2010
Springer
15 years 13 days ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...