Sciweavers

78 search results - page 11 / 16
» Cluster-Based Partial-Order Reduction
Sort
View
FORMATS
2010
Springer
14 years 12 months ago
Layered Composition for Timed Automata
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
Ernst-Rüdiger Olderog, Mani Swaminathan
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
16 years 2 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
SIGSOFT
2009
ACM
16 years 2 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
KBSE
2007
IEEE
15 years 8 months ago
Testing concurrent programs using value schedules
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
Jun Chen, Steve MacDonald
121
Voted
MFCS
2009
Springer
15 years 6 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn