4451 search results - page 456 / 891 » On Random Ordering Constraints |
173
click to vote
JAL
2002
15 years 6 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
190
click to vote
COMPUTER
1999
15 years 6 months ago
1999
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
208
click to vote
AUSAI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
154
click to vote
IAJIT
2010
15 years 5 months ago
2010
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
194
click to vote
IJISEC
2010
15 years 5 months ago
2010
Physical Unclonable Functions (PUFs) are physical objects that are unique, practically unclonable and that behave like a random function when subjected to a challenge. Their use h...