1717 search results - page 114 / 344 » On the analysis of the (1 1) memetic algorithm |
235
click to vote
CLEAR
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. This paper describes Pittsburgh Pattern Recognition’s participation in the face detection and tracking tasks for the CLEAR 2007 evaluation. Since CLEAR 2006, we have ma...
195
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
176
click to vote
SEMWEB
2009
Springer
16 years 28 days ago
2009
Springer
The Automated Semantic Mapping of Ontologies with Validation (ASMOV) algorithm for ontology alignment was one of the top performing algorithms in the 2007 and 2008 Ontology Alignme...
167
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
159
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...