4103 search results - page 487 / 821 » Some results on the Collatz problem |
179
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
157
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
307
click to vote
AGP
2010
IEEE
15 years 11 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
180
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
168
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...