489 search results - page 95 / 98 » Formulations and Reformulations in Integer Programming |
DSN
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we consider the problem of survivable network design in traffic groomed optical WDM mesh networks with sub-wavelength capacity connections. In typical survivable n...
MICRO
2005
IEEE
14 years 1 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
WOWMOM
2005
ACM
14 years 1 months ago
2005
ACM
We consider the energy consumed in radio transmission of a set of sensors forming a data gathering wireless network. Our objective is to enhance the lifetime of such networks by e...
INFOCOM
2000
IEEE
14 years 3 days ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
CPM
2000
Springer
14 years 2 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...