3616 search results - page 51 / 724 » Conditional Memory Ordering |
132
click to vote
STRINGOLOGY
2004
15 years 5 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...
138
Voted
CORR
2006
Springer
15 years 4 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 ...
133
click to vote
JDCTA
2008
15 years 4 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...
141
click to vote
WMASH
2004
ACM
15 years 9 months ago
2004
ACM
Wireless networked embedded terminals like personal digital assistants, cell-phones or sensor nodes are typically memory constrained devices. This limitation prevents the developm...
161
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...