Sciweavers

739 search results - page 8 / 148
» New Games Related to Old and New Sequences
Sort
View
WINE
2007
Springer
161views Economy» more  WINE 2007»
14 years 1 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
SAC
2004
ACM
14 years 1 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
13 years 12 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
BMCBI
2008
163views more  BMCBI 2008»
13 years 7 months ago
ProfileGrids as a new visual representation of large multiple sequence alignments: a case study of the RecA protein family
Background: Multiple sequence alignments are a fundamental tool for the comparative analysis of proteins and nucleic acids. However, large data sets are no longer manageable for v...
Alberto I. Roca, Albert E. Almada, Aaron C. Abajia...
RECOMB
2010
Springer
13 years 5 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff