Sciweavers

579 search results - page 51 / 116
» New efficiency results for makespan cost sharing
Sort
View
EOR
2006
130views more  EOR 2006»
14 years 12 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
ICDM
2003
IEEE
112views Data Mining» more  ICDM 2003»
15 years 5 months ago
Privacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
Srujana Merugu, Joydeep Ghosh
NETWORKING
2000
15 years 1 months ago
Spare Capacity Planning for Survivable Mesh Networks
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...
BMCBI
2007
105views more  BMCBI 2007»
14 years 12 months ago
VaxiJen: a server for prediction of protective antigens, tumour antigens and subunit vaccines
Background: Vaccine development in the post-genomic era often begins with the in silico screening of genome information, with the most probable protective antigens being predicted...
Irini A. Doytchinova, Darren R. Flower
ICS
2009
Tsinghua U.
15 years 4 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...