Search results for "lcs"

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