„Algorithms and complexity“

Suchergebnisse

1.000+ Treffer

• 08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms
  Dyer, Martin ; Jerrum, Mark ; Karpinski, Marek
• Intelligent Engineering Informatics – Proceedings of the 6th International Conference on FICTA
  Bhateja, Vikrant ; Coello Coello, Carlos A. ; Satapathy, Suresh Chandra ; Pattnaik, Prasant Kumar 2018 Springer Singapore
• 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)
  Jacob, Riko ; Müller-Hannemann, Matthias 2006 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
  Chen, Yiling ; Dimitrov, Stanko ; Sami, Rahul ; Reeves, Daniel M. ; Pennock, David M. ; Hanson, Robin ; Fortnow, Lance ; Gonen, Rica
• Fast algorithms of attribute reduction for covering decision systems with minimal elements in discernibility matrix
  Dong, Ze ; Sun, Ming ; Yang, Yanyan
• On the spontaneous stochastic dynamics of a single gene: complexity of the molecular interplay at the promoter
  Coulon, Antoine ; Gandrillon, Olivier ; Beslon, Guillaume
• Predicting run time of classification algorithms using meta-learning
  Doan, Tri ; Kalita, Jugal
• Simplified Game of Life: Algorithms and Complexity
  Chatterjee, Krishnendu ; Ibsen-Jensen, Rasmus ; Jecker, Ismaël ; Svoboda, Jakub 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Online Multistage Subset Maximization Problems
  Bampis, Evripidis ; Escoffier, Bruno ; Schewior, Kevin ; Teiller, Alexandre
• Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints
  Kacem, Imed ; Kellerer, Hans
• Is increasing complexity of algorithms the price for higher accuracy? virtual comparison of three algorithms for tertiary level management of chronic cough in people living with HIV in a low-income country
  Mukabatsinda, Constance ; Nguyen, Jasmine ; Bisig, Bettina ; Lynen, Lutgarde ; Coppens, Yerma D. ; Asiimwe, Anita ; Van Den Ende, Jef
• Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
  Caragiannis, Ioannis ; Fanelli, Angelo ; Gravin, Nikolai
• A Generalization of Nemhauser and Trotter's Local Optimization Theorem
  Fellows, Michael R. ; Guo, Jiong ; Moser, Hannes ; Niedermeier, Rolf 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
  Egidi, Lavinia ; Louza, Felipe A. ; Manzini, Giovanni
• A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
  Madathil, Jayakrishnan ; Sharma, Roohani ; Zehavi, Meirav
• Integrating Web-Based Collaborative Live Editing and Wireframing into a Model-Driven Web Engineering Process
  Lange, Peter de ; Nicolaescu, Petru ; Neumann, Alexander Tobias ; Klamma, Ralf
• Approximability of Clique Transversal in Perfect Graphs
  Fiorini, Samuel ; Krithika, R. ; Narayanaswamy, N. S. ; Raman, Venkatesh
• Can Finite Samples Detect Singularities of Real-Valued Functions?
  Ben-David, S.
• The Consecutive Ones Submatrix Problem for Sparse Matrices
  Tan, Jinsong ; Zhang, Louxin
• Multiplicative Up-Drift
  Doerr, Benjamin ; Kötzing, Timo