|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 255 occurrences of 201 keywords
|
|
|
Results
Found 1008 publication records. Showing 1008 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
120 | Frédéric Magniez, Ashwin Nayak 0001, Peter C. Richter, Miklos Santha |
On the hitting times of quantum versus random walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 86-95, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
85 | Faisal N. Abu-Khzam |
Kernelization Algorithms for d-Hitting Set Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 434-445, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
74 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |
Hitting Sets Derandomize BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 357-368, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
62 | Dogan Kesdogan, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith |
Breaking Anonymity by Learning a Unique Minimum Hitting Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings, pp. 299-309, 2009, Springer, 978-3-642-03350-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Dogan Kesdogan, Lexi Pimenidis |
The Hitting Set Attack on Anonymity Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Information Hiding ![In: Information Hiding, 6th International Workshop, IH 2004, Toronto, Canada, May 23-25, 2004, Revised Selected Papers, pp. 326-339, 2004, Springer, 3-540-24207-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
59 | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
Near-linear approximation algorithms for geometric hitting sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 23-32, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
geometric range spaces, shallow cuttings, union of simply-shaped regions, randomized algorithms, hitting sets |
59 | Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church |
Query suggestion using hitting time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 469-478, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
personalized query suggestion, bipartite graph, query suggestion, hitting time |
59 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
On the Minimum Hitting Set of Bundles Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings, pp. 3-14, 2008, Springer, 978-3-540-68865-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimum hitting set, min k??sat, approximation algorithm |
59 | James Bailey 0001, Peter J. Stuckey |
Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages, 7th International Symposium, PADL 2005, Long Beach, CA, USA, January 10-11, 2005, Proceedings, pp. 174-186, 2005, Springer, 3-540-24362-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Minimal unsatisfiable sets, constraint solving, hitting sets, hypergraph transversals |
59 | Vincenzo Cutello, Giuseppe Nicosia |
A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIRN/NAIS ![In: Neural Nets, 16th Italian Workshop on Neural Nets, WIRN 2005, and International Workshop on Natural and Artificial Immune Systems, NAIS 2005, Vietri sul Mare, Italy, June 8-11, 2005, Revised Selected Papers, pp. 324-337, 2005, Springer, 3-540-33183-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Minimum Hitting Set problem, Evolutionary Computation, Combinatorial Optimization, Satisfiability, Immune Algorithms, Clonal Selection Algorithms, Information Gain, Graph coloring problem |
58 | Roberto Beraldi |
Biased Random Walks in Uniform Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 8(4), pp. 500-513, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
58 | Pei-Yan Zhang, Tian-Sheng Lü |
Real-Time Motion Planning for a Volleyball Robot Task Based on a Multi-Agent Technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 49(4), pp. 355-366, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
task-based manipulability measure, volleyball robot, multi-agent, motion planning, blackboard |
58 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |
A New General Derandomization Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(1), pp. 179-213, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
BPP, derandomization, Boolean circuits |
50 | Ojas Parekh, Danny Segev |
Path Hitting in Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(4), pp. 466-486, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Edge cover, Tree augmentation, Tree multicut, Approximation algorithms, Linear programming, Primal-dual, Edge dominating set |
50 | Markus Bläser, Moritz Hardt, David Steurer |
Asymptotically Optimal Hitting Sets Against Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 345-356, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
50 | John E. Hopcroft, Daniel Sheldon |
Manipulation-Resistant Reputations Using Hitting Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAW ![In: Algorithms and Models for the Web-Graph, 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings, pp. 68-81, 2007, Springer, 978-3-540-77003-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
50 | Peter Damaschke |
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 332-343, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
combinatorial inference, algorithms, parameterization, counting, hypergraph transversals |
50 | Ojas Parekh, Danny Segev |
Path Hitting in Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 564-575, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Joost C. Dessing, Simone R. Caljouw, C. (Lieke) E. Peper, Peter Jan Beek |
A dynamical neural network for hitting an approaching object. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Biol. Cybern. ![In: Biol. Cybern. 91(6), pp. 377-387, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
50 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
Smaller Kernels for Hitting Set Problems of Constant Arity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 121-126, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
50 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |
Efficient Construction of Hitting Sets for Systems of Linear Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 387-398, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
48 | Christopher Umans |
Reconstructive Dispersers and Hitting Set Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 134-156, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hitting set generator, Derandomization, Disperser |
48 | Nabil H. Mustafa, Saurabh Ray |
PTAS for geometric hitting set problems via local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 17-22, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithm, local search, hitting sets, epsilon nets |
48 | Paul Bogdan, Radu Marculescu |
Hitting Time Analysis for Stochastic Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NanoNet ![In: Nano-Net - Third International ICST Conference, NanoNet 2008, Boston, MA, USA, September 14-16, 2008, Revised Selected Papers, pp. 39-43, 2008, Springer, 978-3-642-02426-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Network-on-Chip, reliable communication, hitting time |
48 | Peter Bro Miltersen, N. V. Vinodchandran |
Derandomizing Arthur-Merlin Games Using Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 71-80, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
derandomization, hitting sets, Arthur-Merlin games |
48 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan |
Weak Random Sources, Hitting Sets, and BPP Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 264-272, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
BPP simulations, parallel classes, lower bound, sampling, polynomial time, randomised algorithms, hitting sets, weak random source, weak random sources, min-entropy |
47 | Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf |
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 143-154, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra |
Performance analysis of mobility-assisted routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2006, Florence, Italy, May 22-25, 2006, pp. 49-60, 2006, ACM, 1-59593-368-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
routing, ad-hoc networks, delay tolerant networks, mobility modelling, intermittent connectivity, hitting times |
39 | Eli Gafni, Petr Kuznetsov |
Brief announcement: on L-resilience, hitting sets, and colorless tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 81-82, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
distributed tasks, l-resilience, weak solvability, wait-freedom |
39 | Jirí Síma, Stanislav Zák |
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 522-531, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Henning Fernau |
Parameterized Algorithms for Hitting Set: The Weighted Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 332-343, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Vincenzo Cutello, Francesco Pappalardo 0001 |
The Hitting Set Problem and Evolutionary Algorithmic Techniques with ad-hoc Viruses (HEAT-V). ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part II, pp. 1570-1571, 2003, Springer, 3-540-40603-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
39 | L. Sunil Chandran |
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings, pp. 283-290, 1999, Springer, 3-540-66836-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
35 | Chunquan Xu, Aiguo Ming, Takeharu Nagaoka, Makoto Shimojo |
Motion Control of a Golf Swing Robot. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 56(3), pp. 277-299, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Energy control, Golf swing, PGCTC control, Target dynamics, Motion control |
35 | Klim Efremenko, Omer Reingold |
How Well Do Random Walks Parallelize?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 476-489, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Markov Chains, Random Walks |
35 | Faisal N. Abu-Khzam |
Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(3), pp. 399-410, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Oliver Kullmann |
The Combinatorics of Conflicts between Clauses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 426-440, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Julia Kempe |
Discrete Quantum Walks Hit Exponentially Faster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 354-369, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Chris Calabro, Ramamohan Paturi |
k-SAT Is No Harder Than Decision-Unique-k-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings, pp. 59-70, 2009, Springer, 978-3-642-03350-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
unique satisfiability, independent set, quantified Boolean formulas, hitting set, k-SAT, exponential complexity |
32 | Boris Aronov, Esther Ezra, Micha Sharir |
Small-size epsilon-nets for axis-parallel rectangles and boxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 639-648, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
?-nets, geometric range spaces, randomized algorithms, set cover, hitting set |
32 | Saurabh Ray, Nabil H. Mustafa |
An optimal generalization of the centerpoint theorem, and its extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 138-141, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
centerpoint theorem, extremal methods, hitting convex sets, weak ?-nets, discrete geometry, combinatorial geometry |
32 | Xiangfu Zhao, Dantong Ouyang |
Improved Algorithms for Deriving All Minimal Conflict Sets in Model-Based Diagnosis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007, Proceedings, pp. 157-166, 2007, Springer, 978-3-540-74170-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
conflict set, set enumeration tree (SE-tree), model-based diagnosis, hitting set |
32 | Ronen Shaltiel, Christopher Umans |
Low-end uniform hardness vs. randomness tradeoffs for AM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 430-439, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hardness vs. randomness tradeoff, hitting-set generator, derandomization, Arthur-Merlin games |
32 | Manuela-Luminita Bujorianu, John Lygeros |
Reachability Questions in Piecewise Deterministic Markov Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 6th International Workshop, HSCC 2003 Prague, Czech Republic, April 3-5, 2003, Proceedings, pp. 126-140, 2003, Springer, 3-540-00913-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Markov processes, Hybrid systems, reachability, hitting times |
32 | Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 133-141, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
infrequent sets, Data mining, independent sets, hitting sets, transversals, frequent sets, dualization |
30 | Yanke Chen, Lan Li, Xiaodong Li |
Correlation analysis of structural characteristics of table tennis players' hitting movements and hitting effects based on data analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entertain. Comput. ![In: Entertain. Comput. 48, pp. 100610, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
30 | Xiaoning Zhu, Xiaoping Zhu, Rui Yan, Rui Peng |
Optimal routing, aborting and hitting strategies of UAVs executing hitting the targets considering the defense range of targets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Eng. Syst. Saf. ![In: Reliab. Eng. Syst. Saf. 215, pp. 107811, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
30 | Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay |
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, pp. 187-200, 2018, Springer, 978-3-319-77403-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Bart M. P. Jansen |
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 21(2), pp. 219-243, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
30 | Bart M. P. Jansen |
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1507.05890, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
30 | Bart M. P. Jansen |
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, pp. 472-486, 2015, Springer, 978-3-662-53173-0. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
30 | Nicolas Bousquet |
Hitting sets : VC-dimension and Multicut. (Hitting sets : VC-dimension et Multicut). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
30 | Sau-lai Lee, Ivy Yee-man Lau |
Hitting a robot vs. hitting a human: is it the same? ![Search on Bibsonomy](Pics/bibsonomy.png) |
HRI ![In: Proceedings of the 6th International Conference on Human Robot Interaction, HRI 2011, Lausanne, Switzerland, March 6-9, 2011, pp. 187-188, 2011, ACM, 978-1-4503-0561-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Peter Damaschke |
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 32-42, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Peter Bro Miltersen, N. V. Vinodchandran |
Derandomizing Arthur-Merlin Games using Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(3), pp. 256-279, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
27 | Christopher Umans |
Reconstructive Dispersers and Hitting Set Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 460-471, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Devan Sohier, Alain Bui |
Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Yanfang Li, Volkan Patoglu, Marcia Kilchenman O'Malley |
Negative efficacy of fixed gain error reducing shared control for training in virtual environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Appl. Percept. ![In: ACM Trans. Appl. Percept. 6(1), pp. 3:1-3:21, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
haptic assistance, motor skill training, virtual training, Shared control, manual control |
23 | Yoshiaki Nonaka, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita |
How to Design a Linear Cover Time Random Walk on a Finite Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings, pp. 104-116, 2009, Springer, 978-3-642-04943-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Amir Shpilka, Ilya Volkovich |
Read-once polynomial identity testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 507-516, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits |
23 | Tianshi Chen 0002, Ke Tang 0001, Guoliang Chen 0001, Xin Yao 0001 |
On the analysis of average time complexity of estimation of distribution algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 453-460, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Marc Thurley |
Kernelizations for Parameterized Counting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 703-714, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Lixin Ding, Yingzhou Bi |
About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Computational Intelligence and Security, International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers, pp. 209-219, 2006, Springer, 978-3-540-74376-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee |
Two Variations of the Minimum Steiner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 101-120, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time |
23 | Lixin Ding, Jinghu Yu |
Some theoretical results about the computation time of evolutionary algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 1409-1415, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Dynkin's formula, drift analysis, evolutionary algorithms, computation time |
23 | Sebastian Wernicke 0001, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
Avoiding Forbidden Submatrices by Row Deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2004: Theory and Practice of Computer Science, 30th Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 24-30, 2004, pp. 349-360, 2004, Springer, 3-540-20779-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Astrid Lundmark, Leif Haglund |
Adaptive Spatial and Temporal Prefiltering for Video Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCIA ![In: Image Analysis, 13th Scandinavian Conference, SCIA 2003, Halmstad, Sweden, June 29 - July 2, 2003, Proceedings, pp. 953-960, 2003, Springer, 3-540-40601-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Naveen Garg 0001, Rohit Khandekar |
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 500-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Luca Trevisan |
Non-approximability results for optimization problems on bounded degree instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 453-461, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | V. S. Anil Kumar 0001, Sunil Arya, H. Ramesh |
Hardness of Set Cover with Intersection 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 624-635, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim |
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 179-189, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Abdul Basit 0001, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza |
Improving the first selection lemma in R3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 354-357, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
centerpoints, first selection lemma, hitting simplices, location depth |
21 | Youjun Xu, Dantong Ouyang, Yuxin Ye, Jialiang He |
Solving SAT Problem with Boolean Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCST ![In: Fifth International Conference on Frontier of Computer Science and Technology, FCST 2010, Changchun, Jilin Province, China, August 18-22, 2010, pp. 271-275, 2010, IEEE Computer Society, 978-0-7695-4139-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
extension rule, automated reasoning, boolean algebra, satisfiability problem, hitting set |
21 | Evangelia Pyrga, Saurabh Ray |
New existence proofs epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 199-207, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
strong ?-nets, discrete geometry, hitting sets, hypergraph transversals |
21 | Shai Fine, Yishay Mansour |
Active sampling for multiple output identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 213-228, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Active sampling, Output identification, Separation dimension, Active learning, Hitting, VC dimension, Transductive learning |
21 | Saurabh Ray, Nabil H. Mustafa |
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 239-244, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hitting convex sets, weak epsilon nets, discrete geometry, combinatorial geometry |
21 | Frédéric Magniez, Ashwin Nayak 0001, Jérémie Roland, Miklos Santha |
Search via quantum walk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 575-584, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
amplitude amplification, phase gap, recursive amplitude amplification, reflection operator, spectral gap, search, Markov chain, phase estimation, hitting time, quantum walk |
21 | Masakiyo Miyazawa |
A Markov Renewal Approach to M/G/1 Type Queues with Countably Many Background States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 46(1-2), pp. 177-196, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
M/G/1 type queue, ladder height, Markov renewal theorem, hitting probability, decay rate, duality, stationary distribution, Markov additive process |
21 | Henryk Fuks, Anna T. Lawniczak, Stanislav Volkov |
Packet delay in models of data networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 11(3), pp. 233-250, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
packet switching, random walk, packet delay, routing table, Hitting time |
21 | Fumiaki Machihara |
Busy-period and blocking behavior of finite queues with state-dependent Markov renewal arrivals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 16(1-2), pp. 97-113, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
first hitting time, Markov renewal, preemptive resume, preemptive repeat, Busy-period, stochastic ordering, non-preemptive |
21 | Carsten Lund, Mihalis Yannakakis |
On the Hardness of Approximating Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(5), pp. 960-981, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
clique cover, approximation algorithms, NP-hard, graph coloring, dominating set, set cover, independent set, chromatic number, probabilistically checkable proofs, hitting set |
21 | Mary Jean Harrold, Rajiv Gupta 0001, Mary Lou Soffa |
A Methodology for Controlling the Size of a Test Suite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 2(3), pp. 270-285, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
software engineering, software maintenance, regression testing, test suite reduction, hitting set |
15 | Sepehr Hajebi, Yanjia Li, Sophie Spirkl |
Hitting all maximum stable sets in P5-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 165, pp. 142-163, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko |
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 139, pp. 103479, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Zac Pullar-Strecker, Katharina Dost, Eibe Frank, Jörg Wicker |
Hitting the target: stopping active learning at the cost-based optimum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 113(4), pp. 1529-1547, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Jacob Focke, Fabian Frei, Shaohua Li 0005, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki |
Hitting Meets Packing: How Hard Can it Be? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.14927, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Avik Pal, Madhura Pawar |
Hitting "Probe"rty with Non-Linearity, and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.16168, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad |
Face-hitting Dominating Sets in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.02808, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Yuuho Tanaka |
On the average hitting times of Cay(ZN,{+1,+2}). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 343, pp. 269-276, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Tobias Bleifuß, Thorsten Papenbrock, Thomas Bläsius, Martin Schirneck, Felix Naumann |
Discovering Functional Dependencies through Hitting Set Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Manag. Data ![In: Proc. ACM Manag. Data 2(1), pp. 43:1-43:24, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | |
Correction to: Hitting Times of Random Walks on Edge Corona Product Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 67(3), pp. 1210, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Mingzhe Zhu, Wanyue Xu, Wei Li 0055, Zhongzhi Zhang, Haibin Kan |
Hitting Times of Random Walks on Edge Corona Product Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 67(2), pp. 485-497, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals |
Proving Unsatisfiability with Hitting Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, pp. 48:1-48:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-309-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Javier Larrosa, Conrado Martínez, Emma Rollon |
Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 8057-8064, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Ting Jin, Yuanguo Zhu, Yadong Shu, Jing Cao, Hongyan Yan, Depeng Jiang |
Uncertain optimal control problem with the first hitting time objective and application to a portfolio selection model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 44(2), pp. 1585-1599, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Hiroshi Nakahara, Kazuya Takeda, Keisuke Fujii 0001 |
Estimating the effect of hitting strategies in baseball using counterfactual virtual simulation with deep learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Sci. Sport ![In: Int. J. Comput. Sci. Sport 22(1), pp. 1-12, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Patrick Rodler |
DynamicHS: Streamlining Reiter's Hitting-Set Tree for Sequential Diagnosis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 627, pp. 251-279, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Shuaishuai Tan, Wenyin Liu, Qingkuan Dong, Sammy Chan, Shui Yu 0001, Xiaoxiong Zhong, Daojing He |
Hitting Moving Targets: Intelligent Prevention of IoT Intrusions on the Fly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Internet Things J. ![In: IEEE Internet Things J. 10(23), pp. 21000-21012, dec1 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 19(3), pp. 23:1-23:29, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Jing Yang, Yongjiang Wu, Lihua Feng, Weijun Liu |
Hitting time, resistance distance and Kirchhoff index of Cayley graphs over dicyclic and semi-dihedral groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 448, pp. 127948, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 1008 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|