Sciweavers

970 search results - page 135 / 194
» On encodings of spanning trees
Sort
View
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 3 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
15 years 1 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
IPPS
2010
IEEE
14 years 7 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
ICIP
2003
IEEE
15 years 11 months ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...