Sciweavers

225 search results - page 30 / 45
» On Adaptive Integer Sorting
Sort
View
DAM
2008
88views more  DAM 2008»
13 years 8 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
ARSCOM
2002
69views more  ARSCOM 2002»
13 years 8 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson
CCE
2004
13 years 8 months ago
Solving heat exchanger network synthesis problems with Tabu Search
: This paper describes the implementation of a meta-heuristic optimization approach, Tabu Search (TS), for Heat Exchanger Networks (HEN) synthesis and compares this approach to oth...
B. Lin, D. C. Miller
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 8 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
MOC
2002
70views more  MOC 2002»
13 years 8 months ago
Solving norm equations in relative number fields using S-units
Abstract. In this paper, we are interested in solving the so-called norm equation NL/K(x) = a, where L/K is a given arbitrary extension of number fields and a a given algebraic num...
Denis Simon