Sciweavers

4759 search results - page 305 / 952
» Parallelizing the Phylogeny Problem
Sort
View
ICS
2010
Tsinghua U.
16 years 4 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
CONCUR
2003
Springer
15 years 12 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl
GCC
2003
Springer
15 years 12 months ago
Some Grid Automata for Grid Computing
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
Hao Shen, Yongqiang Sun
EUROPAR
2009
Springer
16 years 1 months ago
Process Mapping for MPI Collective Communications
It is an important problem to map virtual parallel processes to physical processors (or cores) in an optimized way to get scalable performance due to non-uniform communication cost...
Jin Zhang, Jidong Zhai, Wenguang Chen, Weimin Zhen...
CCGRID
2008
IEEE
16 years 1 months ago
GridBatch: Cloud Computing for Large-Scale Data-Intensive Batch Applications
To be competitive, Enterprises are collecting and analyzing increasingly large amount of data in order to derive business insights. However, there are at least two challenges to m...
Huan Liu, Dan Orban