Sciweavers

3267 search results - page 618 / 654
» Generalized quasirandom graphs
Sort
View
CODES
2008
IEEE
14 years 3 months ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra
FOCS
2008
IEEE
14 years 2 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
FOCS
2008
IEEE
14 years 2 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
ICYCS
2008
IEEE
14 years 2 months ago
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
Panlong Yang, Guihai Chen
INFOCOM
2008
IEEE
14 years 2 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...