Sciweavers

676 search results - page 124 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
JCB
2006
115views more  JCB 2006»
13 years 7 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
MSWIM
2009
ACM
14 years 2 months ago
On the impact of far-away interference on evaluations of wireless multihop networks
It is common practice in wireless multihop network evaluations to ignore interfering signals below a certain signal strength threshold. This paper investigates the thesis that thi...
Douglas M. Blough, Claudia Canali, Giovanni Resta,...
STACS
2007
Springer
14 years 1 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
ECRTS
2005
IEEE
14 years 1 months ago
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
AIPS
2010
13 years 9 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill