11328 search results - page 29 / 2266 » Timed Branching Processes |
118
click to vote
IWANN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...
133
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
138
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
Modern CPUs have instructions that allow basic operations to be performed on several data elements in parallel. These instructions are called SIMD instructions, since they apply a...
111
click to vote
CTRSA
2007
Springer
15 years 8 months ago
2007
Springer
This paper announces a new software side-channel attack — enabled by the branch prediction capability common to all modern highperformance CPUs. The penalty paid (extra clock cyc...
137
Voted
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time tem...