Sciweavers

1144 search results - page 226 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
SIROCCO
2010
13 years 10 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SIGCOMM
2010
ACM
13 years 8 months ago
Topology-aware resource allocation for data-intensive workloads
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the ho...
Gunho Lee, Niraj Tolia, Parthasarathy Ranganathan,...
MOR
2008
169views more  MOR 2008»
13 years 8 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
BMCBI
2006
130views more  BMCBI 2006»
13 years 8 months ago
Docking protein domains in contact space
Background: Many biological processes involve the physical interaction between protein domains. Understanding these functional associations requires knowledge of the molecular str...
Stefano Lise, Alice Walker-Taylor, David T. Jones