Sciweavers

519 search results - page 90 / 104
» Granular Problem Solving and Software Engineering
Sort
View
CGO
2011
IEEE
14 years 1 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
HPDC
1999
IEEE
15 years 1 months ago
The Cactus Computational Toolkit and using Distributed Computing to Collide Neutron Stars
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for coll...
Gabrielle Allen, Tom Goodale, Joan Massó, E...
FSTTCS
2009
Springer
15 years 4 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
WWW
2008
ACM
15 years 10 months ago
Composite process oriented service discovery in preserving business and timed relation
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the def...
Yu Dai, Lei Yang, Bin Zhang, Kening Gao
FSTTCS
2009
Springer
15 years 4 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya