Sciweavers

1452 search results - page 123 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
86
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 6 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
101
Voted
ICSE
2010
IEEE-ACM
15 years 2 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
IPPS
1998
IEEE
15 years 4 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
CF
2009
ACM
15 years 7 months ago
Quantitative analysis of sequence alignment applications on multiprocessor architectures
The exponential growth of databases that contains biological information (such as protein and DNA data) demands great efforts to improve the performance of computational platforms...
Friman Sánchez, Alex Ramírez, Mateo ...
153
Voted
CVIU
2011
14 years 4 months ago
A comparative study of object-level spatial context techniques for semantic image analysis
Abstract—In this paper, three approaches to utilizing objectlevel spatial contextual information for semantic image analysis are presented and comparatively evaluated. Contextual...
Georgios Th. Papadopoulos, Carsten Saathoff, Hugo ...