Sciweavers

224 search results - page 32 / 45
» G-graphs for the cage problem: a new upper bound
Sort
View
FUIN
2006
139views more  FUIN 2006»
15 years 6 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
JCAM
2010
116views more  JCAM 2010»
15 years 26 days ago
A vertex-based hierarchical slope limiter for p-adaptive discontinuous Galerkin methods
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
Dmitri Kuzmin
PODC
2004
ACM
15 years 11 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
INFOCOM
2003
IEEE
15 years 11 months ago
Energy Efficient Routing in Ad Hoc Disaster Recovery Networks
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...
Gil Zussman, Adrian Segall
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 6 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu