The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for lcs with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1981-1994 (15) 1995-1999 (22) 2000-2001 (24) 2002-2003 (25) 2004 (16) 2005 (44) 2006 (38) 2007 (51) 2008 (35) 2009 (34) 2010 (17) 2011-2012 (15) 2013-2014 (24) 2015-2016 (20) 2017-2018 (17) 2019-2020 (19) 2021-2022 (16) 2023 (7)
Publication types (Num. hits)
article(109) book(1) incollection(5) inproceedings(322) phdthesis(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 403 occurrences of 199 keywords

Results
Found 439 publication records. Showing 439 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
120Robert E. Smith 0001, Bruce A. Dike, B. Ravichandran, Adel El-Fallah, Raman K. Mehra The Fighter Aircraft LCS: A Case of Different LCS Goals and Techniques. Search on Bibsonomy Learning Classifier Systems The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
99Jan Drugowitsch, Alwyn Barry A Principled Foundation for LCS. Search on Bibsonomy IWLCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
99Zvi Gotthilf, Moshe Lewenstein Approximating Constrained LCS. Search on Bibsonomy SPIRE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
99Wei Liu 0010, Ling Chen 0005, Lingjun Zou A parallel LCS algorithm for biosequences alignment. Search on Bibsonomy Infoscale The full citation details ... 2007 DBLP  DOI  BibTeX  RDF biosequences alignment, parallel processing, bioinformatics
90Franz Baader Computing the Least Common Subsumer in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics. Search on Bibsonomy ICCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
88Gad M. Landau, Avivit Levy, Ilan Newman LCS Approximation via Embedding into Local Non-repetitive Strings. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
79Jan Drugowitsch, Alwyn Barry A formal framework and extensions for function approximation in learning classifier systems. Search on Bibsonomy Mach. Learn. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Kalman filter, Learning classifier systems, Function approximation
79Wei Liu, Lin Chen A Fast Longest Common Subsequence Algorithm for Biosequences Alignment. Search on Bibsonomy CCTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF identical character pair, bioinformatics, longest common subsequence
79Panagiotis D. Michailidis, Konstantinos G. Margaritis New Processor Array Architectures for the Longest Common Subsequence Problem. Search on Bibsonomy J. Supercomput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF longest common subsequence problem, parallel algorithms, VLSI, parallel architectures, linear processor arrays
77Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein Constrained LCS: Hardness and Approximation. Search on Bibsonomy CPM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
77Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson Sparse LCS Common Substring Alignment. Search on Bibsonomy CPM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
68Alexandre Tiskin Semi-local String Comparison: Algorithmic Techniques and Applications. Search on Bibsonomy Math. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF semi-local string comparison, longest common subsequence, String algorithms
68Gregory Anthony Harrison, Eric W. Worden Genetically programmed learning classifier system description and results. Search on Bibsonomy GECCO (Companion) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF agent learning, bucket brigade, genetics-based machine learning (GBML), genetic programming, evolutionary computation, reinforcement learning, intelligent agent, learning classifier system, autonomous agent, complex adaptive system
68Wei Liu 0010, Yixin Chen 0001, Ling Chen 0005, Ling Qin A Fast Parallel Longest Common Subsequence Algorithm Based on Pruning Rules. Search on Bibsonomy IMSCCS (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF identical character pair, Bioinformatics, longest common subsequence
68Atsushi Wada, Keiki Takadama, Katsunori Shimohara Counter example for Q-bucket-brigade under prediction problem. Search on Bibsonomy GECCO Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF reinforcement learning, convergence, learning classifier systems, function approximation, genetic-based machine learning
68Atsushi Wada, Keiki Takadama, Katsunori Shimohara Counter Example for Q-Bucket-Brigade Under Prediction Problem. Search on Bibsonomy IWLCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
68Nian-Feng Tzeng Multistage-Based Switching Fabrics for Scalable Routers. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Line cards, multistage interconnects, queue speedups, recirculation connections, routing tags, scalability, routers, switching fabrics
68Jacob Hurst, Larry Bull, Chris Melhuish TCS Learning Classifier System Controller on a Real Robot. Search on Bibsonomy PPSN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
68Yen-Chun Lin, Jyh-Chian Chen An Efficient Systolic Algorithm for the Longest Common Subsequence Problem. Search on Bibsonomy J. Supercomput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF parallel algorithm, VLSI, systolic array, multicomputer, Longest common subsequence
66David Liben-Nowell, Erik Vee, An Zhu Finding longest increasing and common subsequences in streaming data. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Data-streaming model, Algorithms, Lower bounds, LCS, LIS
66Amihood Amir, Zvi Gotthilf, B. Riva Shalom Weighted LCS. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
66Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson Fast Algorithms for Computing Tree LCS. Search on Bibsonomy CPM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
66Jan Drugowitsch, Alwyn Barry A principled foundation for LCS. Search on Bibsonomy GECCO (Companion) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF bayesian model selection, independently trained local models, xms, learning classifier systems, mixtures-of-experts
66Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur Generalized LCS. Search on Bibsonomy SPIRE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
66Xiao-hua Xu, Ling Chen 0005, Ping He 0001 Fast Sequence Similarity Computing with LCS on LARPBS. Search on Bibsonomy ISPA Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Zhanna V. Zatuchna, Anthony J. Bagnall A learning classifier system for mazes with aliasing clones. Search on Bibsonomy Nat. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Associative perception, Navigation, Learning Classifier Systems, Aliasing, Learning agents, Maze
56Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sarangi Theoretical Framework for Eliminating Redundancy in Workflows. Search on Bibsonomy IEEE SCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
56Alexandre Tiskin All Semi-local Longest Common Subsequences in Subquadratic Time. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
56Jaume Bacardit, Natalio Krasnogor Smart crossover operator with multiple parents for a Pittsburgh learning classifier system. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF smart crossover operator, evolutionary algorithms, learning classifier systems, rule induction
56Ralf Küsters, Ralf Molitor Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions. Search on Bibsonomy Stud Logica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF least common subsumer, complexity, description logics
56Javier G. Marín-Blázquez, Sonia Schulenburg A Hyper-Heuristic Framework with XCS: Learning to Create Novel Problem-Solving Algorithms Constructed from Simpler Algorithmic Ingredients. Search on Bibsonomy IWLCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Hans-Martin Gärtner, Jens Michaelis A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars. Search on Bibsonomy LACL The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Franz Baader A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
56Nian-Feng Tzeng SPAL: A Speedy Packet Lookup Technique for High-Performance Routers. Search on Bibsonomy ICPP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
56Lasse Bergroth, Harri Hakonen, Juri Väisänen New Refinement Techniques for Longest Common Subsequence Algorithms. Search on Bibsonomy SPIRE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
56Henry Selvaraj, B. Li A Parameter to Measure the Efficiency of FPGA Based Logic Synthesis Tools. Search on Bibsonomy EUROMICRO The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
56Bonnie J. Dorr Large-Scale Dictionary Construction for Foreign Language Tutoring and Interlingual Machine Translation. Search on Bibsonomy Mach. Transl. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF foreign language tutoring, interlingual MT, semantic verb classes, syntactic codes, lexical acquisition
56Koji Hakata, Hiroshi Imai The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. Search on Bibsonomy ISAAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
54Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
54Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda Fully Incremental LCS Computation. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
54Marcelo O. Johann, Andrew E. Caldwell, Ricardo Augusto da Luz Reis, Andrew B. Kahng Admissibility Proofs for the LCS* Algorithm. Search on Bibsonomy IBERAMIA-SBIA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
54Bonnie J. Dorr, Maria Katsova Lexical Selection for Cross-Language Applications: Combining LCS with WordNet. Search on Bibsonomy AMTA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
54Nadav Efraty, Gad M. Landau Sparse Normalized Local Alignment. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Largest Common Subsequence (LCS), Algorithms, Dynamic programming, String matching, Local alignment
52John Hurley LESR CLASS: an LCS for securities trading rulesets. Search on Bibsonomy GECCO (Companion) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF evolutionary computing (ec), learning classifier systems (lcs), genetic algorithms (ga), machine learning, market modeling
45William N. L. Browne Improving Evolutionary Computation Based Data-Mining for the Process Industry: The Importance of Abstraction. Search on Bibsonomy Learning Classifier Systems in Data Mining The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
45Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings. Search on Bibsonomy BIBE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Tae Sik Han, Seung-Kyu Ko, Jaewoo Kang Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index. Search on Bibsonomy MLDM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Dual Match, Longest Common Subsequence, Subsequence matching
45Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner The Constrained Longest Common Subsequence Problem for Degenerate Strings. Search on Bibsonomy CIAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45James A. R. Marshall, Gavin Brown 0001, Tim Kovacs Bayesian estimation of rule accuracy in UCS. Search on Bibsonomy GECCO (Companion) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF discounting, inexperience, learning classifier systems, bayesian estimation, UCS
45Renan Cipriano Moioli, Patrícia Amâncio Vargas, Fernando J. Von Zuben Analysing Learning Classifier Systems in Reactive and Non-reactive Robotic Tasks. Search on Bibsonomy IWLCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Javier G. Marín-Blázquez, Sonia Schulenburg Multi-step environment learning classifier systems applied to hyper-heuristics. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF evolutionary computation, heuristics, learning classifier systems, soft computing, hyper-heuristics
45Xiuzhen Huang Lower Bounds and Parameterized Approach for Longest Common Subsequence. Search on Bibsonomy COCOON The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Atsushi Wada, Keiki Takadama, Katsunori Shimohara Learning classifier system equivalent with reinforcement learning with function approximation. Search on Bibsonomy GECCO Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF reinforcement learning, learning classifier systems, function approximation, genetic-based machine learning
45Yang Gao 0001, Joshua Zhexue Huang, Hongqiang Rong, Daqian Gu Learning classifier system ensemble for data mining. Search on Bibsonomy GECCO Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF learning classifier system, ensemble
45Yang Gao 0001, Joshua Zhexue Huang, Hongqiang Rong, Daqian Gu LCSE: Learning Classifier System Ensemble for Incremental Medical Instances. Search on Bibsonomy IWLCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Lasse Bergroth Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem. Search on Bibsonomy SPIRE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45David Liben-Nowell, Erik Vee, An Zhu Finding Longest Increasing and Common Subsequences in Streaming Data. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Alessandro Bogliolo, Valerio Freschi, Filippo Miglioli, Matteo Canella FPGA-Based Parallel Comparison of Run-Length-Encoded Strings. Search on Bibsonomy FPL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan Computing the Least Common Subsumer w.r.t. a Background Terminology. Search on Bibsonomy JELIA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Franz Baader, Anni-Yasmin Turhan On the Problem of Computing Small Representations of Least Common Subsumers. Search on Bibsonomy KI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
45Veli Mäkinen, Gonzalo Navarro 0001, Esko Ukkonen Approximate Matching of Run-Length Compressed Strings. Search on Bibsonomy CPM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
45John H. Holmes A Representation for Accuracy-Based Assessment of Classifier System Prediction Performance. Search on Bibsonomy IWLCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
45Claus Rick Efficient Computation of All Longest Common Subsequences. Search on Bibsonomy SWAT The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
44Rosane Maria Maffei Vallim, David E. Goldberg, Xavier Llorà, Thyago S. P. C. Duque, André C. P. L. F. de Carvalho A new approach for multi-label classification based on default hierarchies and organizational learning. Search on Bibsonomy GECCO (Companion) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF default hierarchies, organizational sizing, LCS
43Alfredo Cuzzocrea, Paolo Serafino LCS-Hist: taming massive high-dimensional data cube compression. Search on Bibsonomy EDBT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
43Xiao-lin Wang, Zheng-Jie Yin Operating Rules Classification System of Water Supply Reservoir Based on LCS. Search on Bibsonomy WKDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
43Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson Two Algorithms for LCS Consecutive Suffix Alignment. Search on Bibsonomy CPM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
43Elham Parvinnia, Mohammad Taheri, Koorush Ziarati An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences. Search on Bibsonomy BMEI (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Longest Common Subsequence (LCS), global alignment
41Effat Farhana, M. Sohel Rahman Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
41Costas S. Iliopoulos, Mohammad Sohel Rahman New efficient algorithms for the LCS and constrained LCS problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park On the Set LCS and Set-Set LCS Problems. Search on Bibsonomy J. Algorithms The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
34Costas S. Iliopoulos, Mohammad Sohel Rahman A New Efficient Algorithm for Computing the Longest Common Subsequence. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Algorithms, Strings, Longest common subsequence
34Jaume Bacardit, Michael Stout, Jonathan D. Hirst, Natalio Krasnogor Data Mining in Proteomics with Learning Classifier Systems. Search on Bibsonomy Learning Classifier Systems in Data Mining The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Lian'en Huang, Lei Wang, Xiaoming Li Achieving both high precision and high recall in near-duplicate detection. Search on Bibsonomy CIKM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF web document repository, similarity, sketch, fingerprint, longest common subsequence, near-duplicate
34W. P. M. H. Heemels, M. Kanat Camlibel, Bernard Brogliato, Johannes M. Schumacher Observer-Based Control of Linear Complementarity Systems. Search on Bibsonomy HSCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Daniel Voigt, Henry Wirth, Werner Dilger A Computational Model for the Cognitive Immune System Theory Based on Learning Classifier Systems. Search on Bibsonomy ICARIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Cognitive Immune System, Cytokines, Modelling, Learning Classifier Systems, Degeneracy
34Takashi Sato, Takumi Uezono, Shiho Hagiwara, Kenichi Okada, Shuhei Amakawa, Noriaki Nakayama, Kazuya Masu A MOS Transistor-Array for Accurate Measurement of Subthreshold Leakage Variation. Search on Bibsonomy ISQED The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Nian-Feng Tzeng Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF line cards, prefix matching search, routing table lookups, Caches, interconnects, routers, tries, forwarding engines
34Minh-Son Dao, Raffaele de Amicis A New Method for Boundary-Based Shape Matching and Retrieval. Search on Bibsonomy ICIP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34M. Sohel Rahman, Costas S. Iliopoulos Algorithms for Computing Variants of the Longest Common Subsequence Problem. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Yang Gao 0001, Lei Wu, Joshua Zhexue Huang Ensemble Learning Classifier System and Compact Ruleset. Search on Bibsonomy SEAL The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Kamran Shafi, Hussein A. Abbass, Weiping Zhu 0001 The Role of Early Stopping and Population Size in XCS for Intrusion Detection. Search on Bibsonomy SEAL The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Alexandre Tiskin Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. Search on Bibsonomy CPM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Atsushi Fujita, Kentaro Inui, Yuji Matsumoto 0001 Exploiting Lexical Conceptual Structure for Paraphrase Generation. Search on Bibsonomy IJCNLP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Olgierd Unold, Grzegorz Dabrowski Use of Learning Classifier System for Inferring Natural Language Grammar. Search on Bibsonomy IWLCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Nadav Efraty, Gad M. Landau Sparse Normalized Local Alignment. Search on Bibsonomy CPM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro 0001 Approximate Matching of Run-Length Compressed Strings. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
34Pierre Gérard, Wolfgang Stolzmann, Olivier Sigaud YACS: a new learning classifier system using anticipation. Search on Bibsonomy Soft Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34Godfrey Tan, John V. Guttag A Locally Coordinated Scatternet Scheduling Algorithm. Search on Bibsonomy LCN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani Effective Lossy Queue Languages. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Janusz Konrad, Bertrand Lacotte, Eric Dubois 0002 Cancellation of image crosstalk in time-sequential displays of stereoscopic video. Search on Bibsonomy IEEE Trans. Image Process. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
34Shaun Saxon, Alwyn Barry XCS and the Monk's Problems. Search on Bibsonomy Learning Classifier Systems The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Brenda S. Baker, Raffaele Giancarlo Longest Common Subsequence from Fragments via Sparse Dynamic Programming. Search on Bibsonomy ESA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
34Bonnie J. Dorr, Nizar Habash, David R. Traum A Thematic Hierarchy for Efficient Generation from Lexical-Conceptual Structure. Search on Bibsonomy AMTA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
34Mi Lu, Hua Lin Parallel Algorithms for the Longest Common Subsequence Problem. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound
34Tao Jiang 0001, Ming Li 0001 On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. Search on Bibsonomy ICALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
34June Power Distributed Systems and Self-Organization. Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
32Kreangsak Tamee, Pornthep Rojanavasu, Sonchai Udomthanapong, Ouen Pinngern Using Self-Organizing Maps with Learning Classifier System for Intrusion Detection. Search on Bibsonomy PRICAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Intrusion Detection, Self-Organizing Map, LCS
32Robert Elliott Smith, Max Kun Jiang MILCS: a mutual information learning classifier system. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF information theory, mutual information, learning classifier systems, XCS, LCS, structural learning
32Neera P. Sood, Ashley G. Williams, Kenneth A. De Jong Evaluating the XCS learning classifier system in competitive simultaneous learning environments. Search on Bibsonomy GECCO Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF machine learning, reinforcement learning, XCS, LCS, prediction accuracy
Displaying result #1 - #100 of 439 (100 per page; Change: )
Pages: [1][2][3][4][5][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license