9521 search results - page 1801 / 1905 » Compiling with continuations, continued |
166
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
158
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
164
click to vote
ALMOB
2006
15 years 6 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
170
click to vote
ALMOB
2006
15 years 6 months ago
2006
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
170
click to vote
ENGL
2008
15 years 6 months ago
2008
High performance computing is becoming increasingly important in the field of financial computing, as the complexity of financial models continues to increase. Many of these financ...