432 search results - page 52 / 87 » Internally deterministic parallel algorithms can be fast |
112
click to vote
ISPDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
142
click to vote
HPCC
2011
Springer
14 years 1 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
104
Voted
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
116
click to vote
ICGI
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
109
Voted
CCGRID
2007
IEEE
15 years 5 months ago
2007
IEEE
In this paper, we present a node mobility prediction framework based on a generic mobile grid architecture. We show how this framework can be used to formulate a cost effective job...