Sciweavers

50 search results - page 5 / 10
» fun 2010
Sort
View
FUN
2010
Springer
306views Algorithms» more  FUN 2010»
14 years 3 months ago
Leveling-Up in Heroes of Might and Magic III
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
Dimitrios I. Diochnos
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 3 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
COCOON
2010
Springer
14 years 3 months ago
Auspicious Tatami Mat Arrangements
The main purpose of this paper is to introduce the idea of tatami tilings, and to present some of the many interesting and fun questions that arise when studying them. Roughly spea...
Alejandro Erickson, Frank Ruskey, Mark Schurch, Je...
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
14 years 3 months ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
14 years 2 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams