Sciweavers

625 search results - page 44 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
CLUSTER
2005
IEEE
15 years 5 months ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski
DATE
2007
IEEE
126views Hardware» more  DATE 2007»
15 years 6 months ago
WAVSTAN: waveform based variational static timing analysis
— We present a waveform based variational static timing analysis methodology. It is a timing paradigm that lies midway between convention static delay approximations and full dyn...
Saurabh K. Tiwary, Joel R. Phillips
WIOPT
2010
IEEE
14 years 10 months ago
Reservation policies for revenue maximization from secondary spectrum access in cellular networks
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...
Ashraf Al Daoud, Murat Alanyali, David Starobinski
TSMC
2008
140views more  TSMC 2008»
14 years 11 months ago
Adaptive Feedback Control by Constrained Approximate Dynamic Programming
A constrained approximate dynamic programming (ADP) approach is presented for designing adaptive neural network (NN) controllers with closed-loop stability and performance guarante...
S. Ferrari, J. E. Steck, R. Chandramohan
STACS
2007
Springer
15 years 5 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...