Sciweavers

225 search results - page 17 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
JMLR
2008
94views more  JMLR 2008»
13 years 9 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 4 months ago
Distributed Estimation and False Data Detection with Application to Power Networks
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...
Fabio Pasqualetti, Ruggero Carli, Francesco Bullo
ICPP
2009
IEEE
13 years 6 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
ATAL
2006
Springer
14 years 24 days ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
MOBIHOC
2007
ACM
14 years 8 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...