Sciweavers

1422 search results - page 101 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
OSS
2009
Springer
15 years 9 months ago
Heartbeat: Measuring Active User Base and Potential User Interest in FLOSS Projects
This paper presents a novel method and algorithm to measure the size of an open source project’s user base and the level of potential user interest that it generates. Previously ...
Andrea Wiggins, James Howison, Kevin Crowston
ICC
2007
IEEE
15 years 9 months ago
Simple and Fair Scheduling Algorithm for Combined Input-Crosspoint-Queued Switch
— In this paper, we propose a fair and simple high-performance scheduling algorithm for Combined Input-Crosspoint-Queued Switches, which is called Tracking Fair Quota Allocation ...
Nan Hua, Peng Wang, Depeng Jin, Lieguang Zeng, Bin...
ASE
2005
137views more  ASE 2005»
15 years 3 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
SEMCO
2008
IEEE
15 years 9 months ago
Text Categorization Based on Boosting Association Rules
Associative classification is a novel and powerful method originating from association rule mining. In the previous studies, a relatively small number of high-quality association...
Yongwook Yoon, Gary Geunbae Lee
ISRR
2005
Springer
211views Robotics» more  ISRR 2005»
15 years 8 months ago
Field D*: An Interpolation-Based Path Planner and Replanner
Abstract. We present an interpolation-based planning and replanning algorithm for generating smooth paths through non-uniform cost grids. Most grid-based path planners use discrete...
Dave Ferguson, Anthony Stentz