4103 search results - page 708 / 821 » Some results on the Collatz problem |
157
click to vote
IOR
2006
15 years 6 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
178
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
171
click to vote
JETAI
2007
15 years 6 months ago
2007
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
166
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
191
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...