✦ LIBER ✦

A faster scrabble move generation algorithm

✍ Scribed by Steven A. Gordon

Book ID: 112210701
Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 840 KB
Volume: 24
Category: Article
ISSN: 0038-0644
DOI: 10.1002/spe.4380240205

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A general algorithm for moving mass prob

A general algorithm for moving mass problems

✍ E.C. Ting; J. Genin; J.H. Ginsberg 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 401 KB

An algorithm is developed to solve the classical problem of the dynamic response of a finite elastic beam supporting a moving mass. An illustrative example is given. The results are shown to compare very well with experimental results.

A faster Galerkin boundary integral algo

A faster Galerkin boundary integral algorithm

✍ Gray, L. J. ;Griffith, B. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

The symmetry present in Green's functions is exploited to signi®cantly reduce the matrix assembly time for a Galerkin boundary integral analysis. A relatively simple modi®cation of the standard Galerkin implementation for computing the non-singular integrals yields a 20±30 per cent decrease in compu

A Faster Deterministic Maximum Flow Algo

A Faster Deterministic Maximum Flow Algorithm

✍ V. King; S. Rao; R. Tarjan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1011 KB

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with \(n\) nodes and \(m\) edges in \(O\left(m n+n^{2} \log ^{2} n\right)\) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We gi

A faster parametric minimum-cut algorith

A faster parametric minimum-cut algorithm

✍ Dan Gusfield; Éva Tardos 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 842 KB

A Faster Katz Status Score Algorithm

✍ Kurt C. Foster; Stephen Q. Muth; John J. Potterat; Richard B. Rothenberg 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 169 KB

A faster algorithm for betweenness centr

A faster algorithm for betweenness centrality*

✍ Brandes, Ulrik 📂 Article 📅 2001 🏛 Taylor and Francis Group 🌐 English ⚖ 621 KB

The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require (n 3 ) time and (n 2 ) space, where n is the number of actors in the network.Motivated by the fast-growing need to compute centrality indices on la