Sciweavers

782 search results - page 75 / 157
» Performance Engineering Case Study: Heap Construction
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
GECCO
2010
Springer
196views Optimization» more  GECCO 2010»
14 years 16 days ago
Using synthetic test suites to empirically compare search-based and greedy prioritizers
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...
Zachary D. Williams, Gregory M. Kapfhammer
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
GLOBECOM
2007
IEEE
14 years 2 months ago
Optimal Power Allocation for Linear Dispersion Codes Over Correlated MIMO Channels with Channel State Feedback
— The design of spatio-temporal power allocation schemes is considered for space-time coding over spatially correlated multiple-input multiple-output (MIMO) channels. The focus i...
Che Lin, Vasanthan Raghavan, Venugopal V. Veeraval...
ICSE
2009
IEEE-ACM
14 years 8 months ago
Maintaining and evolving GUI-directed test scripts
Since manual black-box testing of GUI-based APplications (GAPs) is tedious and laborious, test engineers create test scripts to automate the testing process. These test scripts in...
Mark Grechanik, Qing Xie, Chen Fu