- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for cfm (0.12 sec)
-
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/doc.go
// according to this technique. // // Fair queuing for server requests is inspired by the fair queuing // technique from the world of networking. You can find a good paper // on that at https://dl.acm.org/citation.cfm?doid=75247.75248 or // http://people.csail.mit.edu/imcgraw/links/research/pubs/networks/WFQ.pdf // and there is an implementation outline in the Wikipedia article at // https://en.wikipedia.org/wiki/Fair_queuing . //
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Feb 08 12:33:30 UTC 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* conventional bounded queues, which either block or reject new elements when full. * * <p>This implementation is based on the <a * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al. * Unlike many other double-ended priority queues, it stores elements in a single array, as compact * as the traditional heap data structure used in {@link PriorityQueue}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* conventional bounded queues, which either block or reject new elements when full. * * <p>This implementation is based on the <a * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al. * Unlike many other double-ended priority queues, it stores elements in a single array, as compact * as the traditional heap data structure used in {@link PriorityQueue}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
okhttp/src/test/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat
edu.hn org.hn net.hn mil.hn gob.hn // hr : http://www.dns.hr/documents/pdf/HRTLD-regulations.pdf hr iz.hr from.hr name.hr com.hr // ht : http://www.nic.ht/info/charte.cfm ht com.ht shop.ht firm.ht info.ht adult.ht net.ht pro.ht org.ht med.ht art.ht coop.ht pol.ht asso.ht edu.ht rel.ht gouv.ht perso.ht
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Wed Dec 20 23:27:07 UTC 2023 - 240.3K bytes - Viewed (0) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
<glob pattern="*.COB"/> <sub-class-of type="text/plain"/> </mime-type> <mime-type type="text/x-coldfusion" interpreted="true"> <_comment>ColdFusion source code</_comment> <glob pattern="*.cfm"/> <glob pattern="*.cfml"/> <glob pattern="*.cfc"/> <sub-class-of type="text/plain"/> </mime-type> <mime-type type="text/x-common-lisp"> <_comment>Common Lisp source code</_comment>
Registered: Wed Jun 12 15:17:51 UTC 2024 - Last Modified: Thu Sep 21 06:46:43 UTC 2023 - 298.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
}]; let description = [{ This op uses the algorithm by Marsaglia et al. to acquire samples via transformation-rejection from pairs of uniform and normal random variables. See http://dl.acm.org/citation.cfm?id=358414 }]; let arguments = (ins Arg<TF_I32OrI64Tensor, [{1-D integer tensor. Shape of independent samples to draw from each distribution described by the shape parameters given in alpha.}]>:$shape,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0)