Searched refs:feasible (Results 1 – 25 of 56) sorted by relevance
123
| /external/tensorflow/tensorflow/python/grappler/ |
| D | cluster.i | 271 std::set<string> feasible; in TF_GetSupportedDevices() local
277 std::inserter(feasible, feasible.begin())); in TF_GetSupportedDevices()
279 feasible = supported_dev.second; in TF_GetSupportedDevices()
283 for (const string& type : feasible) { in TF_GetSupportedDevices()
|
| /external/freetype/docs/ |
| D | PROBLEMS | 63 or newer. If this isn't feasible, apply the following patch.
|
| /external/clang/test/Analysis/ |
| D | uninit-vals-ps-region.m | 15 if (global.data == 0) // When the true branch is feasible 'a = 3'.
|
| D | misc-ps-region-store.m | 332 // be '0', meaning that this branch is not feasible.
1138 // here is not feasible in practice, so this is a false positive.
|
| /external/swiftshader/third_party/LLVM/docs/HistoricalNotes/ |
| D | 2001-06-01-GCCOptimizations2.txt | 36 > feasible and should be fun. (Again, link time cost is the issue.)
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-06-01-GCCOptimizations2.txt | 36 > feasible and should be fun. (Again, link time cost is the issue.)
|
| /external/curl/packages/Symbian/ |
| D | readme.txt | 45 feasible.
|
| /external/libtextclassifier/ |
| D | text-classifier.cc | 1340 bool feasible = true; in ModelChunk() local
1344 feasible = false; in ModelChunk()
1349 if (!feasible) { in ModelChunk()
|
| D | model.fbs | 501 // that are feasible (e.g., those that are shorter than max_selection_span),
|
| /external/ltp/doc/ |
| D | nommu-notes.txt | 53 Since this isn't feasible without virtual memory, there is no fork() function.
|
| /external/libmicrohttpd/doc/chapters/ |
| D | basicauthentication.inc | 6 A very simple approach feasible with the means already discussed would
|
| D | tlsauthentication.inc | 123 …ed method of certificates makes it mandatory to set an expiration date---making it less feasible to
|
| /external/wycheproof/doc/ |
| D | dsa.md | 62 be feasible to forge signatures with the values (r=1, s=0) or (r=1, s=q).
|
| D | dh.md | 55 feasible [FGHT16]. Moreover some libraries use primes that are susceptible to
|
| /external/python/cpython3/Doc/library/ |
| D | shelve.rst | 67 dictionary on disk, if feasible. This is called automatically when the shelf
|
| /external/python/cpython2/Doc/library/ |
| D | shelve.rst | 69 dictionary on disk, if feasible. This is called automatically when the shelf
|
| D | email.rst | 42 It is perfectly feasible to create the object structure out of whole cloth ---
|
| /external/python/cpython3/Doc/distutils/ |
| D | introduction.rst | 34 always feasible to expect them to create a multitude of built distributions. It
|
| /external/python/cpython2/Doc/distutils/ |
| D | introduction.rst | 34 always feasible to expect them to create a multitude of built distributions. It
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64CallingConvention.td | 313 // The ELF stub used for TLS-descriptor access saves every feasible
|
| /external/gemmlowp/doc/ |
| D | quantization.md | 64 In order for such zero-padding to be feasible in a quantized implementation of
|
| /external/tensorflow/tensorflow/docs_src/mobile/ |
| D | mobile_intro.md | 160 the on-device component, the whole application wouldn’t be feasible, and this
|
| /external/libjpeg-turbo/ |
| D | README-turbo.txt | 190 feasible (particularly without full acceleration.) However, until/unless
|
| D | README.md | 194 feasible (particularly without full acceleration.) However, until/unless
|
| /external/python/cpython2/Doc/faq/ |
| D | design.rst | 402 approach is feasible, although the speedups reached so far are only modest
405 speedups of 1000x are feasible for small demo programs. See the proceedings
|
123