Sciweavers

7092 search results - page 1087 / 1419
» Parallelizing constraint programs
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
SIAMJO
2010
100views more  SIAMJO 2010»
15 years 1 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
BMCBI
2011
15 years 1 months ago
SNPPicker: High quality tag SNP selection across multiple populations
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
Hugues Sicotte, David N. Rider, Gregory A. Poland,...
ICALP
2009
Springer
16 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
HPDC
2009
IEEE
16 years 1 months ago
TakTuk, adaptive deployment of remote executions
This article deals with TakTuk, a middleware that deploys efficiently parallel remote executions on large scale grids (thousands of nodes). This tool is mostly intended for intera...
Benoit Claudel, Guillaume Huard, Olivier Richard
« Prev « First page 1087 / 1419 Last » Next »