Sciweavers

7886 search results - page 1221 / 1578
» An evaluation of bipartitioning techniques
Sort
View
AOSD
2008
ACM
15 years 9 months ago
Test-based pointcuts for robust and fine-grained join point specification
We propose test-based pointcuts, a novel pointcut mechanism for AspectJ-like aspect-oriented programming languages. The idea behind the test-based pointcuts is to specify join poi...
Kouhei Sakurai, Hidehiko Masuhara
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 9 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
APWEB
2008
Springer
15 years 9 months ago
Mining, Ranking, and Using Acronym Patterns
Techniques for being able to automatically identify acronym patterns are very important for enhancing a multitude of applications that rely upon search. This task is challenging, d...
Xiaonan Ji, Gu Xu, James Bailey, Hang Li
ASM
2008
ASM
15 years 9 months ago
Modeling Workflows, Interaction Patterns, Web Services and Business Processes: The ASM-Based Approach
Abstract. We survey the use of the Abstract State Machines (ASM) method for a rigorous foundation of modeling and validating web services, workflows, interaction patterns and busin...
Egon Börger, Bernhard Thalheim
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
15 years 9 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
« Prev « First page 1221 / 1578 Last » Next »