Treffer 201 - 220 von 4.040

201

Separability of Reachability Sets of Vector Addition Systems
Clemente, Lorenzo ; Czerwiński, Wojciech ; Lasota, Sławomir ; et al.
STACS Symposium on Theoretical Aspects of Computer Science ; https://hal.science/hal-01587619 ; STACS Symposium on Theoretical Aspects of Computer Science, 2017, Hannovre, Germany. ⟨10.4230/LIPIcs.STACS.2017.24⟩

Hannovre Germany Vector Addition Systems... and for sections thereof F11 [Theory F22 [Nonnumerical Algori...
Konferenz
Zu den Favoriten
202

Fine-grained complexity of coloring unit disks and balls
Biró, Csaba ; Bonnet, Edouard ; Marx, Dániel ; et al.
LIPICS ; 33rd International Symposium on Computational Geometry (SoCG 2017) ; https://hal.science/hal-01994374 ; 33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia. ⟨10.4230/LIPIcs.SoCG.2017.18⟩ ; http://socg2017.smp.uq.edu.au/

Brisbane Australia ACM: G.: Mathematics of... ACM: F.: Theory of Compu... [INFO.INFO-CC]Computer S... [INFO.INFO-CG]Computer S...
Konferenz
Zu den Favoriten
203

Towards distance-based phylogenetic inference in average-case linear-time
Crochemore, Maxime ; Francisco, Alexandre ; Pissis, Solon ; et al.
International Workshop on Algorithms in Bioinformatics ; https://hal.archives-ouvertes.fr/hal-01616499 ; International Workshop on Algorithms in Bioinformatics, Aug 2017, Boston, MA, United States. ⟨10.4230/LIPIcs.WABI.2017.00⟩

Boston MA United States F22 Nonnumerical Algorit... computational biology phylogenetic inference
Konferenz
Zu den Favoriten
204

Engineering Parallel In-Place Random Generation of Integer Permutations
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
International Workshop on Experimental Algorithms. :129-141

Provincetown, MA, United... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... ACM: G.: Mathematics of...
Konferenz
Zu den Favoriten
205

A job scheduling framework for large computing farms
Capannini G ; Baraglia R ; Puppin D ; et al.
2007 ACM/IEEE Conference on Supercomputing-SC'07, Reno, NV, USA, 10-16 Nov. 2007
info:cnr-pdr/source/autori:Capannini G.; Baraglia R.; Puppin D.; Ricci L.; Pasquali M./congresso_nome:2007 ACM%2FIEEE Conference on Supercomputing-SC'07/congresso_luogo:Reno, NV, USA/congresso_data:10-16 Nov. 2007/anno:2007/pagina_da:/pagina_a:/intervallo_pagine

Job scheduling 0202 electrical engineer... 0102 computer and inform... 02 engineering and techn... Nonnumerical Algorithms... 01 natural sciences
Fachzeitschrift
Zu den Favoriten
206

A new algorithm for symbolic integral with application: A new algorithm for symbolic integration with application
Xinze Lian ; Weiming Wang
Applied Mathematics and Computation. 162:949-968

0209 industrial biotechn... automatic proving mean-value theorems for... 02 engineering and techn... Symbolic computation and... 01 natural sciences
Fachzeitschrift
Zu den Favoriten
207

Variable Sized Online Interval Coloring with Bandwidth: Variable sized online interval coloring with bandwidth
Epstein, L ; Erlebach, T ; Levin, A
Lecture Notes in Computer Science ISBN: 9783540357537

4. Education 0102 computer and inform... 02 engineering and techn... 15. Life on land 01 natural sciences 7. Clean energy
Buch
Zu den Favoriten
208

The Class Constrained Bin Packing Problem with Applications to Video-on-Demand: The class constrained bin packing problem with applications to video-on-demand
Eduardo C. Xavier ; Flávio Keidi Miyazawa
Lecture Notes in Computer Science ISBN: 9783540369257

bin packing data placement 0211 other engineering a... Bin packing 0102 computer and inform... 02 engineering and techn...
Buch
Zu den Favoriten
209

A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS: A first approach to finding common motifs with gaps
Iliopoulos, Costas ; Mchugh, J. ; Peterlongo, Pierre ; et al.
International Journal of Foundations of Computer Science. 16:1145-1154

inference gapped motifs 0206 medical engineering suffix tree [INFO.INFO-DS] Computer... DNA
Fachzeitschrift
Zu den Favoriten
210

Analysis of MIMD congestion control algorithm for high speed networks
Konstantin Avrachenkov ; Arzad A. Kherani ; Eitan Altman ; et al.
Computer Networks. 48:972-989

MIMD congestion control Scalable TCP Discrete time queues 0202 electrical engineer... Laplace-Stieltjes transf... Random losses
Fachzeitschrift
Zu den Favoriten
211

Interval routing in reliability networks
Gavoille, Cyril ; Nehéz, Martin ; Gavoille, Cyril
Theoretical Computer Science. 333:415-432

Network design and commu... Reliability networks Interval routing Percolation theory 0102 computer and inform... 02 engineering and techn...
Fachzeitschrift
Zu den Favoriten
212

Online Bin Packing with Resource Augmentation: Online bin packing with resource augmentation
Epstein, L. ; Stee, R. van
Lecture Notes in Computer Science ISBN: 9783540245742

ddc:004 online algorithms Applied Mathematics DATA processing & comput... Online algorithms 0211 other engineering a...
Buch
Zu den Favoriten
213

Implicational Relevance Logic is 2-ExpTime-Complete
Schmitz, Sylvain ; Laboratoire Spécification et Vérification [Cachan] (LSV) ; École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS) ; et al.
The Journal of Symbolic Logic. 81(2):641-661

relevance logic branching VASS focusing proofs complexity ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC...
Zeitschrift
Zu den Favoriten
214

Computing the Distance between Piecewise-Linear Bivariate Functions
Moroz, Guillaume ; Aronov, Boris ; Effective Geometric Algorithms for Surfaces and Visibility (VEGAS) ; et al.
ACM Transactions on Algorithms. 12(1):3-3

polyhedral terrain multipoint evaluation piecewise-linearfunction ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Zeitschrift
Zu den Favoriten
215

Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms
Murray, Riley ; Khuller, Samir ; Chao, Megan
Algorithmica. :1-22

Fachzeitschrift
Zu den Favoriten
216

Enhanced Simulated Annealing Technique for the Single-Row Routing Problem: Enhanced simulated annealing technique for the single-row routing problem
Salleh, Shaharuddin ; Sanugi, Bahrom ; Jamaluddin, Hishamuddin ; et al.
The Journal of Supercomputing. 21:285-302

Hardware implementations... QA75 Electronic computer... 0202 electrical engineer... QA Mathematics 02 engineering and techn... Nonnumerical algorithms
Fachzeitschrift
Zu den Favoriten
217

Optimal Sequencing of Contract Algorithms: Optimal sequencing of contract algorithms
Zilberstein, Shlomo ; Charpillet, François ; Chassaing, Philippe ; et al.
Annals of Mathematics and Artificial Intelligence. 39:1-18

real time flexible computation IA contract algorithms 7. Clean energy real-time problem solvin...
Fachzeitschrift
Zu den Favoriten
218

Escaping a Grid by Edge-Disjoint Paths: Escaping a grid by edge-disjoint paths
Chan, Wun-Tat ; Chin, Francis Y. L. ; Ting, Hing-Fung
Algorithmica. 36:343-359

4. Education Graph algorithm 0102 computer and inform... 02 engineering and techn... 16. Peace & justice 7. Clean energy
Fachzeitschrift
Zu den Favoriten
219

An efficient fully polynomial approximation scheme for the Subset-Sum Problem: An efficient fully polynomial approximation scheme for the Subset-Sum problem.
H. KELLERER ; MANSINI, Renata ; U. PFERSCHY ; et al.
Journal of Computer and System Sciences. 66:349-370

Combinatorial optimizati... Computer Networks and Co... Subset-sum problem Fully polynomial approxi... Applied Mathematics 0211 other engineering a...
Fachzeitschrift
Zu den Favoriten
220

Shape reconstruction by genetic algorithms and artificial neural networks
Xiyu, Liu ; Mingxi, Tang ; Frazer, John
Engineering Computations. 20:129-151

surface reconstruction m... model 4. Education design Learning and adaptive sy... 0202 electrical engineer...
Fachzeitschrift
Zu den Favoriten

Filter