Suchergebnisse - "F.2.2 Nonnumerical algorithms and problems"

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions von Larsson, Thomas, Källberg, Linus

“… In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This …”
Volltext

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF von Beyersdorff, Olaf, Blinkhorn, Joshua, Chew, Leroy, Schmidt, Renate, Suda, Martin

“… Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF …”
Volltext

A method for improving full text search using signature files von Yamakawa, Yoshihiro, Fuketa, Masao, Morita, Kazuhiro, Aoe, Jun-ichi

“… Efficiency of full text retrieval using signatures depends on the number of filtering and the reduction of the original text, but there has been no discussion …”
Volltext

A link trie structure of storing multiple attribute relationships for natural language dictionaries von Morita, Kazuhiro, Koyama, Masafumi, Fuketa, Masao, Aoe, Jun-Ichi

“… Word relation is primitive knowledge and it is very useful for natural language processing systems. In the traditional systems, although each knowledge …”
Volltext

A fast retrieval technique for large graph structures von Iriguchi, Hirokazu, Koyama, Masashi, Shishibori, Masami, Aoe, Jun-Ichi

“… Graphs are a typical and basic data structure for computer algorithms. A two-dimensional array and a list are well-known as for their representation. These …”
Volltext

An algorithm for dynamic processing of dawg's von Park, Ki-Hong, Aoe, Jun-Ichi, Morimoto, Katsushi, Shishibori, Masami

“… SCOPE: Algorithms, Information storage and retrieval. A trie is a search tree obtained by merging the common suffixes of the key set. It has the advantage that …”
Volltext

Some results of the relocation problems with processing times and deadlines von Lin, Miao-Tsong, Tseng, Shian-Shyong

“… The relocation problem originates from the public housing project so as to minimize the budgets. Given a set of jobs each demands nt units of resources for …”
Volltext

An optimal schedule for printing and binding von Chin, Francis, Wong, Michael

“… An optimal solution is presented for the scheduling of printing and binding of a book order. The algorithm is simpler and faster than previously known methods …”
Volltext

PARADIGMS ADMITTING SUPERUNITARY BEHAVIOUR IN PARALLEL COMPUTATION von AKL, S. G., LINDON, L. FAVA

“… With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold …”
Volltext

Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories von Spyropoulos, C.D., Evans, D.J

“… This paper presents the extreme performance of the promising Q.A.D. algorithm, for scheduling independent jobs under few pre-set ordering rules on the examined …”
Volltext

Faster Graph Coloring in Polynomial Space von Gaspers, Serge, Lee, Edward J.

“… We present a polynomial-space algorithm that computes the number of independent sets of any input graph in time O ( 1 . 1389 n ) for graphs with maximum degree …”
Volltext

Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms von Murray, Riley, Khuller, Samir, Chao, Megan

“… The Map-Reduce computing framework rose to prominence with datasets of such size that dozens of machines on a single cluster were needed for individual jobs …”
Volltext