4103 search results - page 316 / 821 » Some results on the Collatz problem |
162
click to vote
ACL
1992
15 years 8 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
149
click to vote
DAGSTUHL
1990
15 years 8 months ago
1990
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
207
click to vote
AE
2009
Springer
15 years 8 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...
174
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract-- A novel algorithm to solve constrained realparameter optimization problems, based on the Artificial Bee Colony algorithm is introduced in this paper. The operators used ...
199
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...