Sciweavers

8132 search results - page 264 / 1627
» Dependability, Abstraction, and Programming
Sort
View
MP
1998
83views more  MP 1998»
15 years 6 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
SIAMJO
2010
110views more  SIAMJO 2010»
15 years 1 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
HIPEAC
2011
Springer
14 years 6 months ago
A workload-aware mapping approach for data-parallel programs
Much compiler-orientated work in the area of mapping parallel programs to parallel architectures has ignored the issue of external workload. Given that the majority of platforms w...
Dominik Grewe, Zheng Wang, Michael F. P. O'Boyle
AIRS
2008
Springer
16 years 1 months ago
Study of Kernel-Based Methods for Chinese Relation Extraction
Abstract. In this paper, we mainly explore the effectiveness of two kernelbased methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation e...
Ruihong Huang, Le Sun, Yuanyong Feng
DAGSTUHL
2007
15 years 8 months ago
Decision Procedures for Loop Detection
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
René Thiemann, Jürgen Giesl, Peter Sch...