Sciweavers

2777 search results - page 429 / 556
» Example centric programming
Sort
View
ISPAN
2002
IEEE
15 years 11 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
ICSE
2010
IEEE-ACM
15 years 11 months ago
A search engine for finding highly relevant applications
A fundamental problem of finding applications that are highly relevant to development tasks is the mismatch between the high-level intent reflected in the descriptions of these ...
Mark Grechanik, Chen Fu, Qing Xie, Collin McMillan...
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 11 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
SC
2009
ACM
15 years 11 months ago
Cloud technologies for bioinformatics applications
Executing large number of independent tasks or tasks that perform minimal inter-task communication in parallel is a common requirement in many domains. In this paper, we present o...
Xiaohong Qiu, Jaliya Ekanayake, Scott Beason, Thil...
ATAL
2009
Springer
15 years 11 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon