17049 search results - page 313 / 3410 » cans 2007 |
174
click to vote
CMPB
2007
15 years 6 months ago
2007
This paper describes a method to integrate digital topology informations in image processing libraries. This additional information allows a library user to write algorithms respe...
169
click to vote
CN
2007
15 years 6 months ago
2007
We present a new paradigm, called “Global ISP” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of Qo...
147
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
146
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
199
Voted
COR
2007
15 years 6 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...