485 search results - page 15 / 97 » Iterative Bounding LAO |
CONCUR
1997
Springer
15 years 2 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
124
click to vote
ARC
2010
Springer
15 years 4 months ago
2010
Springer
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
CGO
2007
IEEE
15 years 4 months ago
2007
IEEE
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...