Exploració per autor "Roura Ferret, Salvador"
Ara es mostren els items 65-78 de 78
-
Lists revisited: cache conscious STL lists
(2005-11)
Report de recerca
Accés obertWe present three cache conscious implementations of STL standard compliant lists. Up to now, one could either find simple double linked list implementations that easily cope with standard strict requirements, or theoretical ... -
Median and hybrid median K-dimensional trees
(Springer, 2022)
Article
Accés obertWe consider here two new variants of K-dimensional binary search trees (K-d trees): median K-d trees and hybrid-median K-d trees. These two kinds of trees are designed with the aim to get a tree as balanced as possible. ... -
Minimal representations for majority games
(2007-02)
Report de recerca
Accés obertThis paper presents some new results about majority games. Isbell (1959) was the first to find a majority game without a minimum normalized representation; he needed 12 voters to construct such a game. Since then, it has ... -
Multidimension: a dimensionality extension of simple games
(Springer, 2023-10-20)
Article
Accés obertIn voting theory and social choice theory, decision systems can be represented as simple games, i.e., cooperative games defined through their players or voters and their set of winning coalitions. The weighted voting games ... -
Multikey Quickselect
(2009-07)
Report de recerca
Accés obertIn this paper we introduce Multikey Quickselect: an efficient, in-place, and easy to implement algorithm for the selection problem for strings. We present several variants of our basic algorithm, which apply to two different ... -
New results about the list access problem
(1996-11-27)
Report de recerca
Accés obertWe consider the list access problem and show that two unrealistic assumptions in the original cost model presented in and subsequent literature allow for several competitiveness resulst of the move-to-front heuristic (MTF). ... -
On the competitiveness of the move-to-front rule
(1996-11)
Report de recerca
Accés obertWe consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan (Amortized Efficiency of List Update and Paging Rules, CACM, 28(2):202-208, ... -
On the generalized dimension and codimension of simple games
(2023-04-16)
Article
Accés restringit per política de l'editorialWeighted voting games are simple games that can be represented by a collection of integer weights for each player so that a coalition wins if the sum of the player weights matches or exceeds a given quota. It is known that ... -
Optimal and nearly optimal weighted skip lists
(1995-01-01)
Report de recerca
Accés obertWe consider the problem of building a static (i.e. no updates are performed) skip list of n elements, given these n elements and the corresponding access probabilities or weights. We develop a dynamic programming algorithm ... -
Optimal sampling strategies in quicksort and quickselect
(1998-01)
Report de recerca
Accés obertIt is well-known that the performance of quicksort may substantially be improved by selecting the median of a sample of three elements as the pivot of each partitioning stage. This variant makes more unlikely the ... -
Programación-1: Una asignatura orientada a la resolución de problemas
(2009-06-20T11:38:12Z)
Text en actes de congrés
Accés obertEn este artículo presentamos el nuevo método docente de la asignatura Programació-1 en la Facultat d’Informàtica de Barcelona de la Universitat Politècnica de Catalunya, y damos cuenta de los resultados obtenidos durante ... -
Quad-kd trees: A general framework for kd trees and quad trees
(2016-02-22)
Article
Accés obertWe introduce the quad-kd tree: a general purpose and hierarchical data structure for the storage of multidimensional points. Quad-kd trees include point quad trees and kd trees as particular cases and therefore they could ... -
Randomization of search trees by subtree size
(1996-01)
Report de recerca
Accés obertIn this paper we present probabilistic algorithms over random binary search trees such that: a) the insertion of a set of keys in any fixed order into an initially empty tree produces always a random tree; b) the deletion ... -
Randomized binary search trees
(1997-01)
Report de recerca
Accés obertIn this paper we present randomized algorithms over binary search trees such that: a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; b) the ...
