Sciweavers

205 search results - page 34 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
TASLP
2008
96views more  TASLP 2008»
13 years 8 months ago
Fast Tracing of Acoustic Beams and Paths Through Visibility Lookup
The beam tracing method can be used for the fast tracing of a large number of acoustic paths through a direct lookup of a special tree-like data structure (beam tree) that describe...
Fabio Antonacci, M. Foco, Augusto Sarti, Stefano T...
BMCBI
2008
75views more  BMCBI 2008»
13 years 8 months ago
Re-searcher: a system for recurrent detection of homologous protein sequences
Background: Sequence searches are routinely employed to detect and annotate related proteins. However, a rapid growth of databases necessitates a frequent repetition of sequence s...
Valdemaras Repsys, Mindaugas Margelevicius, Ceslov...

Publication
216views
14 years 1 months ago
Dynamic Matching with a Fall-Back Option
We study dynamic matching without money when one side of the market is dynamic with arrivals and de- partures and the other is static and agents have strict prefer- ences over a...
Sujit Gujar, David Parkes
BMCBI
2007
109views more  BMCBI 2007»
13 years 8 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
HPCA
2001
IEEE
14 years 9 months ago
Speculative Data-Driven Multithreading
Mispredicted branches and loads that miss in the cache cause the majority of retirement stalls experienced by sequential processors; we call these critical instructions. Despite t...
Amir Roth, Gurindar S. Sohi