Sciweavers

489 search results - page 60 / 98
» Formulations and Reformulations in Integer Programming
Sort
View
TCOM
2011
122views more  TCOM 2011»
13 years 2 months ago
Relay Station Placement Strategy in IEEE 802.16j WiMAX Networks
Abstract—In this paper, we study the relay station (RS) placement strategy in IEEE 802.16j WiMAX networks. Specifically, the impact of RS placement on IEEE 802.16j network perfo...
Hsiao-Chen Lu, Wanjiun Liao, Frank Yeong-Sung Lin
CPAIOR
2005
Springer
14 years 1 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
DAC
1999
ACM
14 years 4 days ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
RECOMB
1997
Springer
13 years 12 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
MP
2007
145views more  MP 2007»
13 years 7 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz