1569 search results - page 120 / 314 » Programming contest strategy |
CCCG
1996
15 years 1 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
80
Voted
TCS
2008
15 years 13 days ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
97
Voted
ENTCS
2002
15 years 10 days ago
2002
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
112
Voted
MOBICOM
2004
ACM
15 years 6 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
197
Voted
PLDI
2009
ACM
16 years 1 months ago
2009
ACM
Languages such as Java and C#, as well as scripting languages like Python, and Ruby, make extensive use of Collection classes. A collection implementation represents a fixed choic...