248 search results - page 15 / 50 » The Relative Complexity of NP Search Problems |
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Software design techniques emphasize the use of abstractions to help developers deal with the complexity of constructing large and complex systems. These abstractions can also be u...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
FGCS
2000
13 years 7 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...