4103 search results - page 203 / 821 » Some results on the Collatz problem |
140
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
145
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
188
click to vote
DEXAW
2008
IEEE
16 years 1 months ago
2008
IEEE
Two new variants of Particle Swarm Optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using Beta ...
184
click to vote
WCRE
2008
IEEE
16 years 1 months ago
2008
IEEE
The research domain of aspect mining studies the problem of (semi-)automatically identifying potential aspects and crosscutting concerns in a software system, to improve the syste...
155
click to vote
ECML
2005
Springer
16 years 7 days ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...