1974 search results - page 36 / 395 » Conditional Purchase Orders |
STRINGOLOGY
2004
13 years 11 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
JDCTA
2008
13 years 9 months ago
2008
The international business environment of port logistics has changed drastically in the last few decades. The increase in international trade, advent of ultra-large vessels, chang...
TVCG
2011
13 years 4 months ago
2011
—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...
ISIPTA
2005
IEEE
14 years 3 months ago
2005
IEEE
We study the recently discovered phenomenon [1] of existence of comparative probability orderings on finite sets that violate Fishburn hypothesis [2, 3] — we call such ordering...