Sciweavers

2343 search results - page 323 / 469
» The Locomotive Routing Problem
Sort
View
INFOCOM
2006
IEEE
15 years 11 months ago
Fault-Tolerant Wireless Access Network Design for Dual-Homed Users
— In this paper, we study the survivability problem in hierarchical wireless access networks with dual-homed end users, who are connected to two base stations (BSs), a primary BS...
Xiaodong Huang, Jianping Wang, Vinod Vokkarane, Ja...
IPPS
2006
IEEE
15 years 11 months ago
Evaluating parallel simulated evolution strategies for VLSI cell placement
Simulated Evolution (SimE) is an evolutionary metaheuristic that has produced results comparable to well established stochastic heuristics such as SA, TS and GA, with shorter runti...
Sadiq M. Sait, Mustafa I. Ali, Ali Mustafa Zaidi
148
Voted
COMCOM
2007
103views more  COMCOM 2007»
15 years 5 months ago
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and est...
Kin-Hon Ho, Michael P. Howarth, Ning Wang, George ...
JPDC
2006
187views more  JPDC 2006»
15 years 5 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
NETWORKS
2010
15 years 3 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...