6437 search results - page 342 / 1288 » Parallel Algorithms for Arrangements |
130
click to vote
ECOWS
2006
Springer
15 years 6 months ago
2006
Springer
We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete funct...
113
click to vote
JCC
2010
15 years 2 months ago
2010
Abstract: Modern graphics processing units (GPUs) are flexibly programmable and have peak computational throughput significantly faster than conventional CPUs. Herein, we describ...
129
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
125
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
142
click to vote
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...