16404 search results - page 821 / 3281 » A set coverage problem |
209
click to vote
GECCO
2009
Springer
16 years 6 days ago
2009
Springer
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
187
click to vote
EUROGP
1999
Springer
15 years 12 months ago
1999
Springer
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representati...
172
click to vote
ICSM
1998
IEEE
15 years 12 months ago
1998
IEEE
In this paper, we describe the reengineering of a deteriorated object-oriented industrial program written in C++. The main problem of the program was misplaced code, most often fu...
174
click to vote
CHI
1993
ACM
15 years 11 months ago
1993
ACM
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...
197
click to vote
STACS
1993
Springer
15 years 11 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...