Sciweavers

475 search results - page 73 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
IJES
2006
110views more  IJES 2006»
13 years 7 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar
SODA
2012
ACM
173views Algorithms» more  SODA 2012»
11 years 10 months ago
Resource augmentation for weighted flow-time explained by dual fitting
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
S. Anand 0002, Naveen Garg, Amit Kumar
MOBICOM
2009
ACM
14 years 2 months ago
Capacity of large-scale CSMA wireless networks
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
Chi-Kin Chau, Minghua Chen, Soung Chang Liew
GLOBECOM
2008
IEEE
14 years 2 months ago
QoS Routing in Wireless Mesh Networks with Cognitive Radios
— In this paper, we study QoS routing in wireless mesh networks with cognitive radios, which involves route selection, channel allocation and scheduling. It turns out to be a har...
Roberto Hincapie, Jian Tang, Guoliang Xue, Roberto...
CDC
2010
IEEE
166views Control Systems» more  CDC 2010»
13 years 2 months ago
A numerical method for the optimal control of switched systems
Switched dynamical systems have shown great utility in modeling a variety of systems. Unfortunately, the determination of a numerical solution for the optimal control of such syste...
Humberto González, Ramanarayan Vasudevan, M...