Treffer 201 - 220 von 3.806

201

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
202

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
203

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
204

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
205

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
206

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
207

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
208

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
209

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
210

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
211

Efficient Gossip and Robust Distributed Computation: Efficient gossip and robust distributed computation
Georgiou, Chryssis ; Kowalski, D. R. ; Shvartsman, A. A. ; et al.
Lecture Notes in Computer Science ISBN: 9783540201847
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Lect. Notes Comput. Sci.
Theoretical Computer Science
Theor.Comput.Sci.

distributed algorithms Communication graphs Gossip Communication primitives 0102 computer and inform... 02 engineering and techn...
Buch
Zu den Favoriten
212

On a Conjecture on Wiener Indices in Combinatorial Chemistry: A conjecture on Wiener indices in combinatorial chemistry
Yih-En Andrew Ban ; Sergey Bereg ; Nabil H. Mustafa
Lecture Notes in Computer Science ISBN: 9783540405344

Distance in graphs path Combinatorial chemistry Matrix searching enumerating 0102 computer and inform...
Buch
Zu den Favoriten
213

An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees
Gascuel, Olivier ; Elemento, Olivier ; Carvalho De Matos, Christine
Lecture Notes in Computer Science ISBN: 9783540403111

0301 basic medicine duplication trees distance-based methods Gene families gene families 0206 medical engineering
Fachzeitschrift
Zu den Favoriten
214

Covering a Set of Points with a Minimum Number of Turns: Covering a set of points with a minimum number of turns.
Michael J. Collins
Lecture Notes in Computer Science ISBN: 9783540405344

4. Education turns 0102 computer and inform... 02 engineering and techn... TSP 16. Peace & justice
Buch
Zu den Favoriten
215

Two-dimensional pattern matching with rotations
Amir, Amihood ; Butman, Ayelet ; Crochemore, Maxime ; et al.
Lecture Notes in Computer Science ISBN: 9783540403111

Rotation [INFO.INFO-DS] Computer... Analysis of algorithms 0102 computer and inform... 0101 mathematics Nonnumerical algorithms
Fachzeitschrift
Zu den Favoriten
216

Constrained tree inclusion
Gabriel Valiente
Lecture Notes in Computer Science ISBN: 9783540403111

Subtree isomorphism combinatorial algorithms subtree homeomorphism Subtree homeomorphism Noncrossing bipartite ma... 0102 computer and inform...
Fachzeitschrift
Zu den Favoriten
217

Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer: Improved compact visibility representation of planar graphs via Schnyder's realizer
Lin, C.-C. ; Lu, Hsueh-I ; Sun, I-F. ; et al.
Lecture Notes in Computer Science ISBN: 9783540006237

Computational Geometry (... FOS: Computer and inform... B.7.2 I.3.6 Graph representations (g... G.2.2
Buch
Zu den Favoriten
218

Extracting Approximate Patterns: Extended Abstract
Joël Alexandre ; Johann Pelfrêne ; Saïd Abdeddaïm
Lecture Notes in Computer Science ISBN: 9783540403111

pattern discovery string matching Pattern recognition, spe... 0206 medical engineering design and analysis of a... don't care character
Buch
Zu den Favoriten
219

Efficient Algorithms for Online Decision Problems: Efficient algorithms for online decision problems
Santosh Vempala ; Adam Tauman Kalai
Lecture Notes in Computer Science ISBN: 9783540407201

Optimization online algorithms Computer Networks and Co... Applied Mathematics Online algorithms 0102 computer and inform...
Buch
Zu den Favoriten
220

Finding hidden independent sets in interval graphs
Alejandro López-Ortiz ; Angèle M. Hamel ; Tomáš Vinař ; et al.
Lecture Notes in Computer Science ISBN: 9783540405344

0301 basic medicine Independent set 0102 computer and inform... Gene finding 16. Peace & justice Adaptive algorithms
Fachzeitschrift
Zu den Favoriten

Filter