The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1962-1972 (17) 1973 (15) 1974-1976 (20) 1977-1978 (27) 1979-1980 (19) 1981 (18) 1982 (16) 1983-1984 (24) 1985 (30) 1986 (22) 1987 (23) 1988 (35) 1989 (32) 1990 (57) 1991 (68) 1992 (45) 1993 (51) 1994 (63) 1995 (62) 1996 (88) 1997 (93) 1998 (109) 1999 (126) 2000 (124) 2001 (170) 2002 (186) 2003 (189) 2004 (233) 2005 (316) 2006 (383) 2007 (392) 2008 (445) 2009 (332) 2010 (166) 2011 (151) 2012 (182) 2013 (192) 2014 (185) 2015 (220) 2016 (204) 2017 (214) 2018 (220) 2019 (231) 2020 (208) 2021 (196) 2022 (234) 2023 (214) 2024 (55)
Publication types (Num. hits)
article(3613) book(2) data(1) incollection(57) inproceedings(2991) phdthesis(38)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2868 occurrences of 1891 keywords

Results
Found 6702 publication records. Showing 6702 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
16Patric R. J. Östergård, Esa Antero Seuranen Unidirectional covering codes. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Daniel Bienstock, Mark Zuckerberg Approximate fixed-rank closures of covering problems. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Martin Hoefer 0001 Non-cooperative Facility Location and Covering Games. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell Algorithms for two-box covering. Search on Bibsonomy SCG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF exact and approximate algorithms
16Jigang Wang, Predrag Neskovic, Leon N. Cooper A Minimum Sphere Covering Approach to Pattern Classification. Search on Bibsonomy ICPR (3) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Hamid Hentous, Farid Benhammadi, Mohamed Aissani, Kadda Beghdad Bey Fingerprint Matching Based on Minutiae Covering Zones. Search on Bibsonomy ISCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Ridge feature matching, Minutia pairing, AFIS, Fingerprint identification
16Broderick Crawford, Carlos Castro 0001 Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems. Search on Bibsonomy ICAISC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Ke-rui Weng, Chao Yang, Yunfeng Ma Two Artificial Intelligence Heuristics in Solving Multiple Allocation Hub Maximal Covering Problem. Search on Bibsonomy ICIC (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Hans A. Kestler, Wolfgang Lindner 0002, André Müller Learning and Feature Selection Using the Set Covering Machine with Data-Dependent Rays on Gene Expression Profiles. Search on Bibsonomy ANNPR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Magdalene Grantson, Christos Levcopoulos Covering a Set of Points with a Minimum Number of Lines. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Eliyahu Osherovich, Alfred M. Bruckstein, Vladimir Yanovski Covering a Continuous Domain by Distributed, Limited Robots. Search on Bibsonomy ANTS Workshop The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 Minimum Membership Set Covering and the Consecutive Ones Property. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16William Zhu 0001, Fei-Yue Wang 0001 Covering Based Granular Computing for Conflict Analysis. Search on Bibsonomy ISI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Mingen Lin, Yang Yang 0012, Jinhui Xu 0001 On Lazy Bin Covering and Packing Problems. Search on Bibsonomy COCOON The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Ishay Haviv, Oded Regev 0001 Hardness of the Covering Radius Problem on Lattices. Search on Bibsonomy CCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Francesco di Cugno, Tommaso Di Noia, Eugenio Di Sciascio, Azzurra Ragone Concept Covering for Automated Building Blocks Selection based on Business Processes Semantics. Search on Bibsonomy CEC/EEE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Tin Kam Ho Symmetries from Uniform Space Covering in Stochastic Discrimination. Search on Bibsonomy SSPR/SPR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
16Jianxing Yin Cyclic Difference Packing and Covering Arrays. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF AMS Classification: 05B15
16Patric R. J. Östergård, Jörn Quistorff, Alfred Wassermann New Results on Codes with Covering Radius 1 and Minimum Distance 2. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Jun He 0004, Xin Yao 0001, Jin Li 0005 A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem. Search on Bibsonomy IEEE Trans. Syst. Man Cybern. Part C The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Johannes Fürnkranz, Peter A. Flach ROC 'n' Rule Learning - Towards a Better Understanding of Covering Algorithms. Search on Bibsonomy Mach. Learn. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF inductive rule learning, rule evaluation metrics, coverage space, ROC analysis
16Federico Della Croce, Vangelis Th. Paschos Computing Optimal Solutions for the min 3-set covering Problem. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Azzurra Ragone, Simona Colucci Automated semantic web services orchestration via concept covering. Search on Bibsonomy WWW (Special interest tracks and posters) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF semantic web, semantic web services, description logics, orchestration
16Arindam Biswas 0002, Partha Bhowmick, Bhargab B. Bhattacharya TIPS: On Finding a Tight Isothetic Polygonal Shape Covering a 2D Object. Search on Bibsonomy SCIA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger A Note on Semi-online Machine Covering. Search on Bibsonomy WAOA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Charles J. Colbourn, Yinong Chen, Wei-Tek Tsai Progressive Ranking and Composition of Web Services Using Covering Arrays. Search on Bibsonomy WORDS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16François Laviolette, Mario Marchand, Mohak Shah Margin-Sparsity Trade-Off for the Set Covering Machine. Search on Bibsonomy ECML The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Janusz Kacprzyk, Grazyna Szkatula An Inductive Learning Algorithm with a Partial Completeness and Consistence via a Modified Set Covering Problem. Search on Bibsonomy ICANN (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Yong He, György Dósa Bin Packing and Covering Problems with Rejection. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Zhixiang Chen 0001, Bin Fu, Yong Tang 0001, Binhai Zhu A PTAS for a Disc Covering Problem Using Width-Bounded Separators. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Jianer Chen, Fenghui Zhang On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4]. Search on Bibsonomy AAIM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Edward Ochmanski Covering Fairness against Conspiracies. Search on Bibsonomy ICATPN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Taejin Park, Kwang Ryel Ryu Exploiting Unexpressed Genes for Solving Large-Scaled Maximal Covering Problems. Search on Bibsonomy PRICAI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Jose Torres-Jimenez, Carlos de Alfonso, Vicente Hernández Computation of Ternary Covering Arrays Using a Grid. Search on Bibsonomy AACC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Klaus Jansen Approximation Algorithms for Mixed Fractional Packing and Covering Problems. Search on Bibsonomy WAOA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Lucas Lessing, Irina Dumitrescu, Thomas Stützle A Comparison Between ACO Algorithms for the Set Covering Problem. Search on Bibsonomy ANTS Workshop The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu Indexing Continual Range Queries with Covering Tiles for Fast Locating of Moving Objects. Search on Bibsonomy ICDCS Workshops The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Bin Xiao 0001, Jiannong Cao 0001, Qingfeng Zhuge, Yi He 0001, Edwin Hsing-Mean Sha Approximation Algorithms Design for Disk Partial Covering Problem. Search on Bibsonomy ISPAN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Brahim Hnich, Steven D. Prestwich, Evgeny Selensky Constraint-Based Approaches to the Covering Test Problem. Search on Bibsonomy CSCLP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Teruyuki Yorioka Forcings with the countable chain condition and the covering number of the Marczewski ideal. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
16Aladár Heppes Covering the Plane with Fat Ellipses without Non-Crossing Assumption. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
16Cunsheng Ding, Jin Yuan Covering and Secret Sharing with Linear Codes. Search on Bibsonomy DMTCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
16Oscar Moreno, Francis N. Castro On the Covering Radius of Certain Cyclic Codes. Search on Bibsonomy AAECC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
16Marcella Anselmo, Maria Madonia Covering Problems from a Formal Language Point of View. Search on Bibsonomy Developments in Language Theory The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
16Claude Carlet, Emmanuel Prouff Vectorial Functions and Covering Sequences. Search on Bibsonomy International Conference on Finite Fields and Applications The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
16Oliver Schütze, Sanaz Mostaghim, Michael Dellnitz, Jürgen Teich Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. Search on Bibsonomy EMO The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
16Fernando Borrás, Jesús T. Pastor The Ex-Post Evaluation of the Minimum Local Reliability Level: An Enhanced Probabilistic Location Set Covering Model. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
16Daniel W. Cunningham A covering lemma for L(R). Search on Bibsonomy Arch. Math. Log. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
16Marc Demange, Vangelis Th. Paschos Algorithms and Models for the On-Line Vertex-Covering. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
16Malek Rahoual, Riad Hadji, Vincent Bachelet Parallel Ant System for the Set Covering Problem. Search on Bibsonomy Ant Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
16Roberto Cordone, Fabrizio Ferrandi, Donatella Sciuto, Roberto Wolfler Calvo An efficient heuristic approach to solve the unate covering problem. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16Dan Ismailescu Inequalities between Lattice Packing and Covering Densities of Centrally Symmetric Plane Convex Bodies. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16Sofia Kovaleva, Frits C. R. Spieksma Approximation of a Geometric Set Covering Problem. Search on Bibsonomy ISAAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16János Csirik, David S. Johnson, Claire Kenyon Better approximation algorithms for bin covering. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
16Klaus Jansen Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16Roberto Cordone, Fabrizio Ferrandi, Donatella Sciuto, Roberto Wolfler Calvo An Efficient Heuristic Approach to Solve the Unate Covering Problem. Search on Bibsonomy DATE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Dagmar Handke, Guy Kortsarz Tree Spanners for Subgraphs and Related Tree Covering Problems. Search on Bibsonomy WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
16Dan Ismailescu Covering the Plane with Copies of a Convex Disk. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
16Jakub Wroblewski Covering with Reducts - A Fast Algorithm for Rule Generation. Search on Bibsonomy Rough Sets and Current Trends in Computing The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
16Nian-Feng Tzeng, Gui Liang Feng Resource Allocation in Cube Network Systems Based on the Covering Radius. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Binary n-cubes, integer nonlinear programs, multiple connection, single connection, resource allocation, linear block codes
16Alberto Caprara, Matteo Fischetti, Paolo Toth A Heuristic Algorithm for the Set Covering Problem. Search on Bibsonomy IPCO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
16Nan-Chi Chou, Lung-Tien Liu, Chung-Kuan Cheng, Wei-Jin Dai, Rodney Lindelof Local ratio cut and set covering partitioning for huge logic emulation systems. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16E. Kolev Mixed Covering Codes with Two Binary and Four Ternary Coordinates. Search on Bibsonomy AAECC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Jan Cederquist, Sara Negri A Constructive Proof of the Heine-Borel Covering Theorem for Formal Reals. Search on Bibsonomy TYPES The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
16Iiro S. Honkala A Lower Bound on Binary Codes with Covering Radius One. Search on Bibsonomy Algebraic Coding The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
16Gilles Zémor An Extremal Problem Related to the Covering Radius of Binary Codes. Search on Bibsonomy Algebraic Coding The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16G. L. Katsman Bounds on Covering Radius of Dual Product Codes. Search on Bibsonomy Algebraic Coding The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Alexander A. Davydov Constructions of Codes with Covering Radius 2. Search on Bibsonomy Algebraic Coding The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Philippe Langevin On the Orphans and Covering Radius of the Reed-Muller Codes. Search on Bibsonomy AAECC The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Nripendra N. Biswas On covering distant minterms by the camp algorithm. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
16Gérard D. Cohen Covering Radius and Writing on Memories. Search on Bibsonomy AAECC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
16M. Pipponzi, Fabio Somenzi An iterative algorithm for the binate covering problem. Search on Bibsonomy EURO-DAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
16Fabrizio Lombardi, Mariagiovanna Sami, Renato Stefanelli Reconfiguration of VLSI arrays by covering. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
16David M. Mount, Ruth Silverman Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
16J. Mark Keil Minimally Covering a Horizontally Convex Orthogonal Polygon. Search on Bibsonomy SCG The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
16Armin Friedli Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations. Search on Bibsonomy J. ACM The full citation details ... 1973 DBLP  DOI  BibTeX  RDF
16Harvey M. Salkin, Ronald D. Koncal Set Covering by an All Integer Algorithm: Computational Experience. Search on Bibsonomy J. ACM The full citation details ... 1973 DBLP  DOI  BibTeX  RDF
13Nidhi Arora, Kiran Chandramohan, Nagaraju Pothineni, Anshul Kumar Instruction Selection in ASIP Synthesis Using Functional Matching. Search on Bibsonomy VLSI Design The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Functional Matching, ASIP, Covering, Confluence, Structural Matching
13Guodong Rong, Miao Jin, Xiaohu Guo Hyperbolic centroidal Voronoi tessellation. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2010 DBLP  DOI  BibTeX  RDF universal covering space, hyperbolic geometry, geometric structure, centroidal Voronoi tessellation
13Anthony P. Leclerc Interval Analysis: Parallel Methods for Global Optimization. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Covering methods, Optimization, Parallel algorithms, Branch and bound, Mathematical programming, Interval analysis
13Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Jacobsen, Li Zha Efficient event-based resource discovery. Search on Bibsonomy DEBS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF publish/subscribe applications, subscription similarity, service discovery, resource discovery, covering, content-based publish/subscribe
13Mirali Sharifi, Fatemeh Toossi, Tofig Kazimov An Approach for Selecting Active Nodes in Wireless Sensor Networks by Using Genetic Algorithms. Search on Bibsonomy NCM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF genetic algorithm, sensor networks, covering, active nodes, active nodes
13Shuhua Su The Connectedness Relative to a Sub-base in the L-Fuzzy Topological Space. Search on Bibsonomy FSKD (6) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF L-Fuzzy topology, relative interior, relative closure, connectedness relative to a sub-base, covering generalized rough set
13Alexey S. Rodionov, Olga D. Sokolova, Anastasia N. Yurgenson, Hyunseung Choo On Optimal Placement of the Monitoring Devices on Channels of Communication Network. Search on Bibsonomy ICCSA (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF hypernets, network monitoring, covering problem
13Wei Zeng 0002, Ying He 0001, Jiazhi Xia, Xianfeng Gu, Hong Qin 0001 C∞ smooth freeform surfaces over hyperbolic domains. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2009 DBLP  DOI  BibTeX  RDF hyperbolic structure, uniformization metric, universal covering space, manifold, curvature flow
13Andreas Blass, Yuri Gurevich Program termination and well partial orderings. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF covering observation, game criterion, well partial orderings, Program termination
13Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF capacitated covering, rectangle stabbing, Approximation algorithms, lot sizing
13Thierry Vallée, Alain Bretto Hamiltonicity of Simplicial-Connected Graphs: An Algorithm Based on Clique Decomposition. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Clique Covering, Network, Graph Theory, Graph Algorithms, Hamiltonicity
13Mathias Perournalnaïk, Gilles Énée Towards Self-Adjustment of Adapted Pittsburgh Classifier System Cognitive Capacity on Multi-Step Problems. Search on Bibsonomy HIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Adapted Pittsburgh Classifier System, cognitive capacity, non-markovian multistep environments, covering
13Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal Multi-armed bandits in metric spaces. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF covering dimension, multi-armed bandit problem, online learning, metric spaces
13Ya-Shuai Lü, Li Shen 0007, Libo Huang, Zhiying Wang 0003, Nong Xiao Customizing computation accelerators for extensible multi-issue processors with effective optimization techniques. Search on Bibsonomy DAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF subgraph covering, VLIW, ASIPs, extensible processors
13Hua Ni, Hernán G. Abeledo A branch-and-price approach for large-scale employee tour scheduling problems. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Tour scheduling, Decomposition, Set-covering, Branch-and-price
13Kwangsoo Kim, Hong Seo Ryoo Selecting Genotyping Oligo Probes Via Logical Analysis of Data. Search on Bibsonomy Canadian AI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF oligo probes, LAD, viral pathogens, optimization, microarrays, set covering, learning theory
13Renée C. Bryce, Atif M. Memon Test suite prioritization by interaction coverage. Search on Bibsonomy DOSTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF t-way interaction coverage, event driven software, test suite prioritization, covering arrays, combinatorial interaction testing
13Renée C. Bryce, Charles J. Colbourn One-test-at-a-time heuristic search for interaction test suites. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF great flood, t-way interaction testing, test suite prioritization, simulated annealing, tabu search, heuristic search, hill climbing, covering arrays, software interaction testing
13Myra B. Cohen, Matthew B. Dwyer, Jiangfan Shi Interaction testing of highly-configurable systems in the presence of constraints. Search on Bibsonomy ISSTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF constraints, SAT, covering arrays, combinatorial interaction testing
13Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampon Chain Dominated Orders. Search on Bibsonomy Order The full citation details ... 2006 DBLP  DOI  BibTeX  RDF covering relation, jump number, transitive reduction, truncated lattice, visibility relation, dimension, partially ordered set, digraph, convex set, interval order
13Chi-Shong Wang, Chingwei Yeh Performance-driven technology mapping with MSG partition and selective gate duplication. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF gate duplication, maximal super-gate, super-gate, dynamic programming, partition, matching, logic synthesis, directed acyclic graph, Technology mapping, covering
13Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu 0002, Chung-Kuan Cheng, Michael D. Hutton Efficient static timing analysis using a unified framework for false paths and multi-cycle paths. Search on Bibsonomy ASP-DAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF biclique covering, false subgraphs, multi-cycle subgraphs, static timing analysis, time shifting
13Wingo Sai-Keung Wong, George Baciu A randomized marking scheme for continuous collision detection in simulation of deformable surfaces. Search on Bibsonomy VRCIA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF randomized marking scheme, interactive simulation, deformable surfaces, set-covering problems, continuous collision detection
Displaying result #401 - #500 of 6702 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][>>]
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