• Suche: "Computing complexity"

Treffer 21 - 40 von 6.060

21

Dieses Ergebnis kann Gästen nicht angezeigt werden.

22

Norms on Semi-Lipschitz Functions: An Approach to Computing Complexity by Partial Functions
S. Romaguera ; J. M. Sánchez-Álvarez ; Theodore E. Simos ; et al.
AIP Conference Proceedings. 936:472-475

0101 mathematics 01 natural sciences
Fachzeitschrift
Zu den Favoriten
23

Dieses Ergebnis kann Gästen nicht angezeigt werden.

24

The task of synthesis of analog filter with the specified admissible values of the output characteristics and computing complexity of the methods of their solution
Petro Stakhiv ; Ruslan Shevchuk ; Svitlana Krepych ; et al.
The Experience of Designing and Application of CAD Systems in Microelectronics. :119-121

Fachzeitschrift
Zu den Favoriten
25

Computing complexity distances between algorithms
ROMAGUERA, S ; SANCHEZ-PEREZ, E. A ; VALERO, O
[Use of mathematical methods in computer science and the information society]Kybernetika. 39(5):569-582

Control theory, operatio... Automatique, recherche o... Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn... …
Konferenz
Zu den Favoriten
26

Decreasing in computing complexity of high-order problem of nonlinear programming
Zasyadko, A. A. ; Zasyadko, A. A.
The Banking University Bulletin; No. 2(23) (2015); 158-162; № 2(23) (2015); 158-162; № 2(23) (2015); 158-162; 2221-755X; 10.18371/2221-755x2(23)2015

E-Ressource
Zu den Favoriten
27

Building a Custom, Technology Enabled Delivery Stack; Impact of Reduced Computing Complexity

Competition 9. Industry and infrastr... Cloud Computing Social Construction of T... Serverless Computing 3. Good health
Dissertation
Zu den Favoriten
28

NFC-1: Comprehending Consumers: Computing Complexity of Cultures
Tanida, Yasuo ; Kano Glückstad, Fumiko
Journal of the Japanese Society for Artificial Intelligence. 35(6):807-808

Fachzeitschrift
Zu den Favoriten
29

How Combinatory Logic Can Limit Computing Complexity
Bergier Hugolin
EPJ Web of Conferences, Vol 244, p 01009 (2020)

Physics QC1-999
Fachzeitschrift
Zu den Favoriten
30

Ubiquitous Computing, Complexity, and Culture
Ekman, Ulrik ; Bolter, Jay David ; Søndergaard, Morten ; et al.
Ekman, U, Bolter, J D, Diaz, L, Søndergaard, M & Engberg, M (eds) 2016, Ubiquitous Computing, Complexity and Culture. Routledge, New York. https://doi.org/10.4324/9781315781129
Søndergaard, M 2016, Interview with Mogens Jacobsen. in Ubiquitous Computing, Complexity and Culture. Routledge, pp. 253-255. https://doi.org/10.4324/9781315781129
Søndergaard, M 2016, Interview with Mogens Jacobsen . in Ubiquitous Computing, Complexity and Culture . Routledge, pp. 253-255 . https://doi.org/10.4324/9781315781129

ta6131 ta6132
Buch
Zu den Favoriten
31

Computing complexity distances between algorithms.
Salvador Romaguera ; Enrique Alfonso Sánchez-Pérez ; óscar Valero
Kybernetika. 39(5):569-582

Fachzeitschrift
Zu den Favoriten
32

Au seuil de la complexité calculatoire / At the threshold of the computing complexity
COCCO, S ; DUBOIS, O ; MANDLER, J ; et al.
Pour la science. (295):52-60

Multidisciplinary Multidisciplinaire Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
33

Minimizing the computing complexity of iterative sequential thinning algorithm
Yun Xia
[1988 Proceedings] 9th International Conference on Pattern Recognition. :721-723

0202 electrical engineer... 02 engineering and techn...
Fachzeitschrift
Zu den Favoriten
34

Ubiquitous Computing, Complexity and Culture
Diaz-Kommonen, Lily ; Diaz-Kommonen, Lily

ta6131 ta6132
Buch
Zu den Favoriten
35

Venses @ AcCompl-It: Computing Complexity vs Acceptability with a Constituent Trigram Model and Semantics
Delmonte, Rodolfo

EVALITA COVID-19 Infodemic linguistica computaziona... Automatic Misogyny Ident... Misogyny on Twitter Post... AlBERTo …
Buch
Zu den Favoriten
37

Low computing complexity architecture design of 2D-to-3D image converter.
Yu-Cheng Fan ; Po-Wei Chen ; Wei-Syuan Chen
ICCE-TW. :99-100

Konferenz
Zu den Favoriten
38

Bilevel fractional programming; Combinatorial matrix analysis; Combinatorial optimization algorithms in resource allocation problem; Combinatorial optimization games; Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Evolutionary algorithms in combinatorial optimization; Fractional programming; Information-based complexity and information-based optimization; Kolmogorov complexity; Mixed integer nonlinear programming; Multi-objective combinatorial optimization; Neural networks for combinatorial optimization; NP-complete problems and proof methodology; Parallel computing: Complexity classes; Quadratic fractional programming: Dinkelbach method; Replicator dynamics in combinatorial optimizationBilevel fractional programming; Combinatorial matrix analysis; Combinatorial optimization algorithms in resource allocation problems; Combinatorial optimization games; Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Evolutionary algorithms in combinatorial optimization; Fractional programming; Information-based complexity and information-based optimization; Kolmogorov complexity; Mixed integer nonlinear programming; Multi-objective combinatorial optimization; NP-complete problems and proof methodology; Parallel computing: Complexity classes; Quadratic fractional programming: Dinkelbach method; Replicator dynamics in combinatorial optimization; Stochastic integer programsFRACTIONAL COMBINATORIAL OPTIMIZATION: FCO
Tomasz Radzik
Encyclopedia of Optimization ISBN: 9780792369325

Buch
Zu den Favoriten
39

Зниження обчислювальної складності за допомогою багатокритеріальної оптимізації в задачі нелінійного програмування ; Применение многокритериальной оптимизации для уменьшения вычислительной сложности задач нелинейного программирования ; Using multi-criteria optimization for decreasing i n computing complexity of the problems of nonlinear programming
А.А. Засядько ; А.А.Засядько ; A.A. Zasjad’ko
Системи обробки інформації. — 2012. — № 8(106). 83-86 ; Системы обработки информации. — 2012. — № 8(106). 83-86 ; Information Processing Systems. — 2012. — № 8(106). 83-86 ; 1681-7710

Зберігання аналіз та захист даних... УДК 519.81:621.372 обчислювальна складність... задача нелінійного прогр... багатокритеріальна оптим... …
Fachzeitschrift
Zu den Favoriten
40

Automates calculant la complexité de suites automatiques / Automata computing complexity of automatic sequences
TAPSOBA, T
Journal de théorie des nombres de Bordeaux. 6(1):127-134

Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn... Sciences et techniques c... Sciences and techniques... …
Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter