Showing 241 - 260 of 3,806

241

Bounds on the Voter Model in Dynamic Networks
Berenbrink, Petra ; Giakkoupis, George ; Kermarrec, Anne-Marie ; et al.
ICALP 2016 ; ICALP 2016 - 43rd International Colloquium on Automata, Languages and Programming ; https://hal.science/hal-01353695 ; ICALP 2016 - 43rd International Colloquium on Automata, Languages and Programming , Jul 2016, Rome, Italy. ⟨10.4230/LIPIcs.ICALP.2016.146⟩

Rome Italy Voting Distributed Computing Conductance Dynamic Graphs
Conference
Save to List
242

The Complexity of Coverability in ν-Petri Nets
Lazić, Ranko ; Schmitz, Sylvain ; Centre for Discrete Mathematics and its Applications Warwick (DIMAP) ; et al.
LICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://inria.hal.science/hal-01265302 ; LICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.467--476, ⟨10.1145/2933575.2933593⟩

New York United States Well-structured transiti... Formal verification Well-quasi-order Order ideal
Conference
Save to List
243

Longest Common Substring with Approximately k Mismatches
Starikovskaya, Tatiana ; Département d'informatique - ENS Paris (DI-ENS) ; École normale supérieure - Paris (ENS-PSL) ; et al.
27th Annual Symposium on Combinatorial Pattern Matching CPM 2016
https://hal.science/hal-03942914
27th Annual Symposium on Combinatorial Pattern Matching CPM 2016, 2016, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2016.21⟩

Warsaw Poland 1998 ACM Subject Classif... string similarity measur... longest common substring sketching
Conference
Save to List
244

Backpropagation
Andrew, Alex M.
IFSR International Series on Systems Science and Engineering ISBN: 9780387751634

0301 basic medicine 0303 health sciences 03 medical and health sc... Learning and adaptive sy... Nonnumerical algorithms
Academic journal
Save to List
245

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem: A fast and practical bit-vector algorithm for the longest common subsequence problem
Yoan J. Pinzón ; Costas S. Iliopoulos ; Maxime Crochemore ; et al.
Information Processing Letters. 80:279-285

0202 electrical engineer... longest common subsequen... [INFO.INFO-DS] Computer... 0102 computer and inform... 02 engineering and techn... Nonnumerical algorithms
Academic journal
Save to List
246

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems: Approximation algorithms for degree-constrained minimum-cost network-design problems
S. S. Ravi ; Daniel J. Rosenkrantz ; Madhav V. Marathe ; et al.
Fundamental Problems in Computing ISBN: 9781402096877

150399 Business and Mana... FOS: Economics and busin... Network design and commu... 0211 other engineering a... network-design problems 0102 computer and inform...
Book
Save to List
247

Seat reservation allowing seat changes
Boyar, Joan ; Krarup, S. ; Nielsen, M.N. ; et al.
Boyar, J, Krarup, S & Nielsen, M N 2001, Seat Reservation Allowing Seat Changes . in C Zaroliagis (ed.), Proceedings of the Satellite Workshops of the 28th International Colloquium on Automata, Languages, and Programming ATMOS 2001 . Elsevier, Electronic Notes in Theoretical Computer Science, vol. 50, pp. 24-38 . https://doi.org/10.1016/S1571-0661(04)00163-X
Boyar, J, Krarup, S & Nielsen, M N 2004, ' Seat Reservation Allowing Seat Changes. ', Journal of Algorithms, vol. 52, pp. 169-192 . https://doi.org/10.1016/j.jalgor.2004.02.002

0102 computer and inform... 02 engineering and techn... Nonnumerical algorithms Min-Change 01 natural sciences accommodating sequences
Academic journal
Save to List
248

Optimal Edge Ranking of Trees in Linear Time: Optimal edge ranking of trees in linear time
Lam, TW ; Yue, FL
Algorithmica. 30:12-33

Mathematics computers Graph theory (including... optimal node ranking Time Complexity Optimal Edge Ranking 0211 other engineering a...
Academic journal
Save to List
249

On-line construction of compact directed acyclic word graphs
Inenaga, S ; Hoshino, H ; Shinohara A ; et al.
Lecture Notes in Computer Science ISBN: 9783540422716

Permutations, words, mat... Data structures Directed acyclic word gr... Applied Mathematics Modes of computation (no... 0102 computer and inform...
Academic journal
Save to List
250

Approximating minimum cocolorings: Approximating minimum cocolorings.
Fomin, Fedor V. ; Kratsch, D. ; Novelli, Jean-Christophe ; et al.
Lecture Notes in Computer Science ISBN: 9783540424871

[INFO.INFO-CL] Computer... Graph theory (including... 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... Partially ordered sets
Academic journal
Save to List
251

High-Performance Algorithmic Engineering for Computationa Phylogenetics: High-performance algorithm engineering for computational phylogenetics
David A. Bader ; Tandy Warnow ; Bernard M. E. Moret
Lecture Notes in Computer Science ISBN: 9783540422334

break-point analysis genome rearrangement 0301 basic medicine sorting by reversals high-performance computi... 0102 computer and inform...
Book
Save to List
252

Non-approximability of Weighted Multiple Sequence Alignment: Non-approximability of weighted multiple sequence alignment.
Bodo Siebert
Lecture Notes in Computer Science ISBN: 9783540424949

Computational biology 0206 medical engineering SP-score Multiple sequence alignm... 0102 computer and inform... 02 engineering and techn...
Book
Save to List
253

Goal Recognition through Goal Graph Analysis: Goal recognition through goal graph analysis
Hong, Jun
Thinking with Diagrams ISBN: 9789048156955

Graph theory (including... 0202 electrical engineer... 02 engineering and techn... name=Artificial Intellig... Problem solving in the c... Nonnumerical algorithms
Academic journal
Save to List
254

Competitive Analysis of the LRFU Paging Algorithm: Competitive analysis of the LRFU paging algorithm
Edith Cohen ; Uri Zwick ; Haim Kaplan
Lecture Notes in Computer Science ISBN: 9783540424239

0202 electrical engineer... paging algorithms competitive analysis 0102 computer and inform... 02 engineering and techn... Nonnumerical algorithms
Academic journal
Save to List
255

VLSI Implementation of the Multistage Detector for Next Generation Wideband CDMA Receivers: VLSI implementation of the multistage detector for next generation wideband CDMA receivers
Xu, Gang ; Rajagopal, Sridhar ; Cavallaro, Joseph R. ; et al.
Information Technology: Transmission, Processing and Storage ISBN: 0792376919

Computing methodologies... Network design and commu... real-time implementation 05 social sciences 02 engineering and techn... CDMA
Academic journal
Save to List
256

Potential-Based Algorithms in Online Prediction and Game Theory: Potential-based algorithms in on-line prediction and game theory
Nicolò Cesa-Bianchi ; Gábor Lugosi
Lecture Notes in Computer Science ISBN: 9783540423430

boosting 4. Education 05 social sciences weighted average predict... 15. Life on land Blackwell's strategy
Book
Save to List
257

A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
Eran Halperin ; Uri Zwick
Lecture Notes in Computer Science ISBN: 9783540422259

Graph theory (including... 0211 other engineering a... MAX CUT algorithm 0102 computer and inform... 02 engineering and techn... semidefinite programming
Academic journal
Save to List
258

Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems: Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems
Joseph (Seffi) Naor ; Reuven Bar-Yehuda ; Jon Feldman ; et al.
Graph Algorithms and Applications 2 ISBN: 9789812388551

Graph theory (including... 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... Nonnumerical algorithms vertex ordering problems
Book
Save to List
259

The dynamic complexity of transitive closure is in DynTC0: The dynamic complexity of transitive closure is in DynTC\(^{0}\).
William Hesse
Lecture Notes in Computer Science ISBN: 9783540414568

fully dynamic algorithm 0202 electrical engineer... 0102 computer and inform... 02 engineering and techn... Nonnumerical algorithms 01 natural sciences
Academic journal
Save to List
260

A (2+ε)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective: A (2+\(\varepsilon\))-approximation algorithm for the generalized preemptive open shop problem with minsum objective
Maxim Sviridenko ; Maurice Queyranne
Lecture Notes in Computer Science ISBN: 9783540422259

preemptive open shop pro... 8. Economic growth 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... Nonnumerical algorithms
Book
Save to List

Filter