Sciweavers

3192 search results - page 497 / 639
» The minimum latency problem
Sort
View
101
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 6 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
INFOCOM
2003
IEEE
15 years 6 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
SPAA
2003
ACM
15 years 6 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
INFOCOM
2002
IEEE
15 years 5 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
BMCBI
2010
80views more  BMCBI 2010»
15 years 27 days ago
Power and sample size estimation in microarray studies
Background: Before conducting a microarray experiment, one important issue that needs to be determined is the number of arrays required in order to have adequate power to identify...
Wei-Jiun Lin, Huey-miin Hsueh, James J. Chen