Sciweavers

1422 search results - page 63 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
FAC
2008
100views more  FAC 2008»
14 years 9 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
IPPS
2007
IEEE
15 years 4 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
15 years 1 months ago
An extensible test framework for the Microsoft StreamInsight query processor
Microsoft StreamInsight (StreamInsight, for brevity) is a platform for developing and deploying streaming applications. StreamInsight adopts a deterministic stream model that leve...
Alex Raizman, Asvin Ananthanarayan, Anton Kirilov,...
PADS
2006
ACM
15 years 3 months ago
Analysing the Performance of Optimistic Synchronisation Algorithms in Simulations of Multi-Agent Systems
In this paper we present a detailed analysis of the performance of the Decision Theoretic Read Delay (DTRD) optimistic synchronisation algorithm for simulations of Multistems. We ...
Michael Lees, Brian Logan, Dan Chen, Ton Oguara, G...
BMCBI
2011
14 years 4 months ago
Appearance frequency modulated gene set enrichment testing
Background: Gene set enrichment testing has helped bridge the gap from an individual gene to a systems biology interpretation of microarray data. Although gene sets are defined a ...
Jun Ma, Maureen A. Sartor, H. V. Jagadish