„randomized algorithms“

Suchergebnisse

373 Treffer

• The Value of Help Bits in Randomized and Average-Case Complexity
  Beigi, Salman ; Etesami, Omid ; Gohari, Amin
• Algorithms and Data Structures – 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings
  Dehne, Frank ; Iacono, John ; Sack, Jörg-Rüdiger 2011 Springer Berlin Heidelberg
• Algorithms and data structures – 12th international symposium ; proceedings
  Dehne, Frank ; Iacono, John ; Sack, Jörg-Rüdiger 2011 Springer
• Effectiveness of medicines review with web-based pharmaceutical treatment algorithms in reducing potentially inappropriate prescribing in older people in primary care: a cluster randomized trial (OPTI-SCRIPT study protocol)
  Clyne, Barbara ; Bradley, Marie C. ; Smith, Susan M. ; Hughes, Carmel M. ; Motterlini, Nicola ; Clear, Daniel ; McDonnell, Ronan ; Williams, David ; Fahey, Tom
• Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
  Shokrollahi, Mohammad Amin 1991 Inst. für Informatik
• Tail estimates for the space complexity of randomized incremental algorithms
  Mehlhorn, Kurt ; Šārîr, Mîkā ; Welzl, Emo 1991 MPI Informatik
• Fast randomized approximate string matching with succinct hash data structures
  Policriti, Alberto ; Prezza, Nicola
• Algorithms and computation
  2010 Springer
• Algorithms and computation
  2010 Springer
• Primality Testing in Polynomial Time – From Randomized Algorithms to "PRIMES Is in P"
  Dietzfelbinger, Martin 2004 Springer Berlin Heidelberg
• Randomized algorithms – 10. - 14.6.1991 (9124)
  Karpiński, Marek 1991 Geschäftsstelle Schloss Dagstuhl
• Biclustering of gene expression data using reactive greedy randomized adaptive search procedure
  Dharan, Smitha ; Nair, Achuthsankar S.
• Randomized Routing Algorithms in Mobile Ad Hoc Networks – A comprehensive study
  Haque, Israat Tanzeena 2009 VDM Verlag Dr. Müller
• On the Optimum Communication Cost Problem in Interconnection Networks – Finding Near-Optimum Solutions for Topology Design Problems Using Randomized Algorithms
  Al-Zamil, Khalid 2009 VDM Verlag Dr. Müller
• Dealing with hard problems – (lecture notes on approximation algorithms and randomized algorithms)
  Chvátal, Vašek 1990 Forschungsinst. für Diskrete Mathematik
• Design and Analysis of Randomized Algorithms – Introduction to Design Paradigms
  Hromkovič, Juraj 2005 Springer Berlin Heidelberg
• Traversals of Infinite Graphs with Random Local Orientations
  White, David 2015 LAP LAMBERT Academic Publishing
• Stability Analysis of Linear Time Invariant systems
  Kavitha, Panneerselvam ; Ayyagari, Ramakalyan 2015 LAP LAMBERT Academic Publishing
• On the size of weights randomized search heuristics
  Reichel, Joachim ; Skutella, Martin 2008 Secretary of the SFB 531
• Design and analysis of randomized and approximation algorithms – 05201 abstracts collection ; Dagstuhl seminar
  Dyer, Martin ; Jerrum, Mark ; Karpinski, Marek 2005 [Internat. Begegnungs- und Forschungszentrum für Informatik]