Sciweavers

3825 search results - page 414 / 765
» The Language of Time: A Reader
Sort
View
CADE
2005
Springer
16 years 7 months ago
Well-Nested Context Unification
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
Jordi Levy, Joachim Niehren, Mateu Villaret
ICALP
2009
Springer
16 years 7 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
16 years 7 months ago
Mashup Feeds: : continuous queries over web services
Mashup Feeds is a system that supports integrated web service feeds as continuous queries. We introduce collectionbased stream processing semantics to enable information extractio...
Arsany Sawires, Divyakant Agrawal, Jun'ichi Tatemu...
PDP
2009
IEEE
16 years 1 months ago
Two Formal Semantics of a Subset of the Paderborn University BSPlib
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
Frédéric Gava, Jean Fortin
ERSHOV
2009
Springer
16 years 1 months ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács