Sciweavers

224 search results - page 9 / 45
» The Complexity of Finding Replicas Using Equality Tests
Sort
View
CAISE
2008
Springer
14 years 11 months ago
How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation
The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of business processes. BPMN offers a wide range of mod...
Michael zur Muehlen, Jan Recker
EUROSYS
2010
ACM
15 years 6 months ago
Splitter: A Proxy-based Approach for Post-Migration Testing of Web Applications
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of ...
Xiaoning Ding, Hai Huang, Yaoping Ruan, Anees Shai...
ISCAS
2006
IEEE
81views Hardware» more  ISCAS 2006»
15 years 3 months ago
Equivalent output-filtering using fast QRD-RLS algorithm for burst-type training applications
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...
Mobien Shoaib, Stefan Werner, J. A. Apoliná...
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
14 years 10 months ago
Empirical analysis of a genetic algorithm-based stress test technique
Evolutionary testing denotes the use of evolutionary algorithms, e.g., Genetic Algorithms (GAs), to support various test automation tasks. Since evolutionary algorithms are heuris...
Vahid Garousi
CORR
2006
Springer
109views Education» more  CORR 2006»
14 years 9 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer