Sciweavers

706 search results - page 96 / 142
» An Integer Linear Programming Approach to Database Design
Sort
View
RTCSA
2008
IEEE
15 years 5 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
71
Voted
GLOBECOM
2007
IEEE
15 years 5 months ago
Using MILP for Optimal Movement Planning in MANETs with Cooperative Mobility
— Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common overarching mission objectives which make it reasonable to expect some degree of coopera...
Ghassen Ben Brahim, Osama Awwad, Ala I. Al-Fuqaha,...
IPPS
2007
IEEE
15 years 5 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert
MSN
2007
Springer
125views Sensor Networks» more  MSN 2007»
15 years 5 months ago
Ensuring Area Coverage in Hybrid Wireless Sensor Networks
Success of Wireless Sensor Networks largely depends whether the deployed network can provide desired coverage with acceptable network lifetime. This paper proposes a distributed pr...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
87
Voted
CGO
2005
IEEE
15 years 4 months ago
A Progressive Register Allocator for Irregular Architectures
Register allocation is one of the most important optimizations a compiler performs. Conventional graphcoloring based register allocators are fast and do well on regular, RISC-like...
David Koes, Seth Copen Goldstein