4103 search results - page 96 / 821 » Some results on the Collatz problem |
216
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
169
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
147
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
191
click to vote
MP
2006
15 years 6 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
182
click to vote
MSWIM
2009
ACM
16 years 1 months ago
2009
ACM
In recent years, the number of sensor network deployments for real-life applications has rapidly increased and it is expected to expand even more in the near future. Actually, for...