Sciweavers

725 search results - page 86 / 145
» heuristics 2010
Sort
View
TON
2010
115views more  TON 2010»
13 years 4 months ago
Design and Provisioning of WDM Networks With Many-to-Many Traffic Grooming
A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group ...
M. A. Saleh, A. E. Kamal
TON
2010
126views more  TON 2010»
13 years 4 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
TSC
2010
159views more  TSC 2010»
13 years 4 months ago
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
Benjamin Speitkamp, Martin Bichler
TSE
2010
123views more  TSE 2010»
13 years 4 months ago
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking
Current stochastic model checkers do not make counterexamples for property violations readily available. In this paper we apply directed explicit state space search to discrete- a...
Husain Aljazzar, Stefan Leue
TAMC
2010
Springer
14 years 3 months ago
Incremental List Coloring of Graphs, Parameterized by Conservation
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
Sepp Hartung, Rolf Niedermeier