Sciweavers

9888 search results - page 1966 / 1978
» compute 2009
Sort
View
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 16 days ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
BMCBI
2010
205views more  BMCBI 2010»
15 years 16 days ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...
EOR
2010
93views more  EOR 2010»
15 years 15 days ago
Two-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, B...
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 13 days ago
Logic Column 15: Coalgebras and Their Logics
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...
Alexander Kurz
152
Voted
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 7 days ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
« Prev « First page 1966 / 1978 Last » Next »