397 search results - page 3 / 80 » Comparing Two Grammar-Based Generation Algorithms: A Case St... |
GECCO
2010
Springer
14 years 13 days ago
2010
Springer
The increase in the complexity of modern software has led to the commensurate growth in the size and execution time of the test suites for these programs. In order to address this...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of lin...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper we analyze the operation of two scheduling algorithms, Class Based Queuing (CBQ) and Delay Bounded Hybrid Proportional Delay (DBHPD). We compare results obtained ...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
This work studies the optimality and stability of timing-driven placement algorithms. The contributions of this work include two parts: 1) We develop an algorithm for generating s...
LREC
2008
13 years 9 months ago
2008
In this paper we present two experiments conducted for comparison of different language identification algorithms. Short words-, frequent words- and n-gram-based approaches are co...