12052 search results - page 731 / 2411 » computing 2010 |
181
click to vote
EOR
2007
15 years 7 months ago
2007
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
169
Voted
EOR
2007
15 years 7 months ago
2007
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
194
click to vote
ECCC
2000
15 years 7 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
265
click to vote
ENDM
2000
15 years 7 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
175
click to vote
EOR
2000
15 years 7 months ago
2000
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...