Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FUN
2010
Springer
279views Algorithms» more  FUN 2010»
11 years 3 months ago
Cracking Bank PINs by Playing Mastermind
The bank director was pretty upset noticing Joe, the system administrator, spending his spare time playing Mastermind, an old useless game of the 70ies. He had fought the instinct ...
Riccardo Focardi, Flaminia L. Luccio
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
11 years 8 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
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
11 years 8 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
FUN
2010
Springer
219views Algorithms» more  FUN 2010»
11 years 9 months ago
The Magic of a Number System
We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
FUN
2010
Springer
306views Algorithms» more  FUN 2010»
11 years 10 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
263views Algorithms» more  FUN 2010»
11 years 10 months ago
Kaboozle Is NP-complete, Even in a Strip
Abstract. Kaboozle is a puzzle consisting of several square cards, each annotated with colored paths and dots drawn on both sides and holes drilled. The goal is to join two colored...
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, ...
FUN
2010
Springer
269views Algorithms» more  FUN 2010»
11 years 10 months ago
The Feline Josephus Problem
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
Frank Ruskey, Aaron Williams
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
11 years 10 months ago
The Urinal Problem
Abstract. A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance ...
Evangelos Kranakis, Danny Krizanc
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
11 years 10 months ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
FUN
2010
Springer
202views Algorithms» more  FUN 2010»
11 years 10 months ago
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem
Nathann Cohen, David Coudert, Dorian Mazauric, Nap...
books