Sciweavers

648 search results - page 7 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
WCE
2007
13 years 8 months ago
A Note on Tornado Diagrams in Interval Decision Analysis
—The research efforts of the DECIDE Research Group have resulted in a decision tool capable of handling imprecise information in complex decision situations. Some of the research...
Jim Idefeldt, Mats Danielson
CCA
2009
Springer
14 years 9 days ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
ANCS
2009
ACM
13 years 5 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
13 years 9 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty
PPOPP
2005
ACM
14 years 1 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber