4103 search results - page 189 / 821 » Some results on the Collatz problem |
151
click to vote
ECCC
2010
15 years 6 months ago
2010
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization r...
172
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
184
click to vote
AI
1998
Springer
15 years 6 months ago
1998
Springer
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
177
Voted
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
156
click to vote
IAT
2007
IEEE
16 years 1 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...