Sciweavers

4117 search results - page 583 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ESOP
2009
Springer
16 years 1 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
ICALP
2009
Springer
16 years 1 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
INFOCOM
2009
IEEE
16 years 1 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
16 years 1 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...
AINA
2007
IEEE
16 years 1 months ago
Power and Delay Analysis of The WEAC Protocol Based MANET Under Video Transport
Abstract— Transporting video over wireless networks has twofold constraints. Not only should it satisfy delay requirements but power minimization and QoS issues should be handled...
Hafiz M. Asif, Tarek R. Sheltami