Power invariant vector sequence compaction
Ali Pınar, C. L. Liu · 1998
Simrdation-based po~verestirnation is commody used for its high accuracy, despite excessive computation times.Techniques have been proposed to speed it up by transforming a given sequence into a shorter one ~v~e preserving the po}ver consumption characteristic of the original sequence.This ~vorkproposes a novel method to compact a given input vector sequence to improve on the etisting techniques.We pro pose a graph model to transform the problem to the problem of finding a heaviest ~veighted trti in a dmected graph.We also propose a heuristic b~ed on rnin-cost flo~v algorithms, using the graph model.Furthermore, ~ve sho~v that generating multiple input.sequences yields better solutions in terms of both accuracy and simtiation time.Experiments sho~ved tbat significant reduction in simtiation times can be achieved ~vith extremely accurate resdts.Experiments *O sho~ved that the generation of mtitiple sequences improved the resrdts further both in terms of accuracy and simtiation time.