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