207 search results - page 5 / 42 » Run-Time Switching Between Total Order Algorithms |
CP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
RECOMB
2009
Springer
14 years 2 months ago
2009
Springer
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
ESA
1995
Springer
13 years 11 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
IEEECIT
2010
IEEE
13 years 5 months ago
2010
IEEE
—Dynamic resource allocation has the potential to provide significant increases in total revenue in enterprise systems through the reallocation of available resources as the dem...
SIAMCOMP
2010
13 years 5 months ago
2010
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...