971 search results - page 110 / 195 » Planning with Reduced Operator Sets |
159
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
172
click to vote
IJON
2006
15 years 6 months ago
2006
Bayesian subspace analysis has been successfully applied in face recognition. However, it suffers from its operating on a whole face difference and using one global linear subspac...
207
click to vote
CPAIOR
2011
Springer
14 years 9 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
171
click to vote
LCTRTS
2001
Springer
15 years 10 months ago
2001
Springer
1 COTS (commercial off-the-shelf) devices are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices...
287
click to vote
ASPLOS
2009
ACM
16 years 7 months ago
2009
ACM
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...