1422 search results - page 83 / 285 » Test Generation Algorithms Based on Preorder Relations |
155
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
176
click to vote
MICRO
2003
IEEE
15 years 11 months ago
2003
IEEE
A dynamic optimizer is a runtime software system that groups a program’s instruction sequences into traces, optimizes those traces, stores the optimized traces in a softwarebase...
191
click to vote
AE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
171
click to vote
ICMCS
2006
IEEE
16 years 10 days ago
2006
IEEE
Recent research in image compression has focused on lossy compression algorithms. However, the baseline implementations of such algorithms generally use a universal quantization p...
192
click to vote
JNW
2008
15 years 5 months ago
2008
This paper proposes a method for scheduling and buffer management in differentiated services networks which is based on JoBS algorithm. JoBS differentiates traffic classes base on ...