4103 search results - page 75 / 821 » Some results on the Collatz problem |
102
click to vote
SLS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
105
click to vote
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
101
click to vote
EAAI
2007
14 years 12 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
EOR
2010
14 years 12 months ago
2010
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...