Sciweavers

3750 search results - page 441 / 750
» Timed Automata Patterns
Sort
View
WWW
2005
ACM
16 years 4 months ago
On business activity modeling using grammars
Web based applications offer a mainstream channel for businesses to manage their activities. We model such business activity in a grammar-based framework. The Backus Naur form not...
Savitha Srinivasan, Arnon Amir, Prasad Deshpande, ...
134
Voted
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 4 months ago
A bayesian mixture model with linear regression mixing proportions
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gu...
STACS
2009
Springer
15 years 10 months ago
Reverse Engineering Prefix Tables
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the d...
Julien Clément, Maxime Crochemore, Giuseppi...
DATE
2009
IEEE
115views Hardware» more  DATE 2009»
15 years 10 months ago
Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources
—As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most kn...
Mircea Negrean, Simon Schliecker, Rolf Ernst
DDECS
2009
IEEE
128views Hardware» more  DDECS 2009»
15 years 10 months ago
A fast untestability proof for SAT-based ATPG
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
Daniel Tille, Rolf Drechsler