Search results for "Hitting"

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.	SODA	2009	DBLP DOI BibTeX RDF
85	Faisal N. Abu-Khzam	Kernelization Algorithms for d-Hitting Set Problems.	WADS	2007	DBLP DOI BibTeX RDF
74	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	Hitting Sets Derandomize BPP.	ICALP	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.	CSR	2009	DBLP DOI BibTeX RDF
62	Dogan Kesdogan, Lexi Pimenidis	The Hitting Set Attack on Anonymity Protocols.	Information Hiding	2004	DBLP DOI BibTeX RDF
59	Pankaj K. Agarwal, Esther Ezra, Micha Sharir	Near-linear approximation algorithms for geometric hitting sets.	SCG	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.	CIKM	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.	AAIM	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.	PADL	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.	WIRN/NAIS	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.	IEEE Trans. Mob. Comput.	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.	J. Intell. Robotic Syst.	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.	J. ACM	1998	DBLP DOI BibTeX RDF	BPP, derandomization, Boolean circuits
50	Ojas Parekh, Danny Segev	Path Hitting in Acyclic Graphs.	Algorithmica	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.	ICALP (1)	2008	DBLP DOI BibTeX RDF
50	John E. Hopcroft, Daniel Sheldon	Manipulation-Resistant Reputations Using Hitting Time.	WAW	2007	DBLP DOI BibTeX RDF
50	Peter Damaschke	The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.	STACS	2007	DBLP DOI BibTeX RDF	combinatorial inference, algorithms, parameterization, counting, hypergraph transversals
50	Ojas Parekh, Danny Segev	Path Hitting in Acyclic Graphs.	ESA	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.	Biol. Cybern.	2004	DBLP DOI BibTeX RDF
50	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Smaller Kernels for Hitting Set Problems of Constant Arity.	IWPEC	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.	STACS	1997	DBLP DOI BibTeX RDF
48	Christopher Umans	Reconstructive Dispersers and Hitting Set Generators.	Algorithmica	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.	SCG	2009	DBLP DOI BibTeX RDF	approximation algorithm, local search, hitting sets, epsilon nets
48	Paul Bogdan, Radu Marculescu	Hitting Time Analysis for Stochastic Communication.	NanoNet	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.	FOCS	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.	FOCS	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.	ESA	2009	DBLP DOI BibTeX RDF
44	Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra	Performance analysis of mobility-assisted routing.	MobiHoc	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.	PODC	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.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
39	Henning Fernau	Parameterized Algorithms for Hitting Set: The Weighted Case.	CIAC	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).	GECCO	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.	FSTTCS	1999	DBLP DOI BibTeX RDF
35	Chunquan Xu, Aiguo Ming, Takeharu Nagaoka, Makoto Shimojo	Motion Control of a Golf Swing Robot.	J. Intell. Robotic Syst.	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?.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	Markov Chains, Random Walks
35	Faisal N. Abu-Khzam	Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
35	Oliver Kullmann	The Combinatorics of Conflicts between Clauses.	SAT	2003	DBLP DOI BibTeX RDF
35	Julia Kempe	Discrete Quantum Walks Hit Exponentially Faster.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
32	Chris Calabro, Ramamohan Paturi	k-SAT Is No Harder Than Decision-Unique-k-SAT.	CSR	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.	STOC	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.	SCG	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.	ICIC (1)	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.	STOC	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.	HSCC	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.	STACS	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.	Entertain. Comput.	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.	Reliab. Eng. Syst. Saf.	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.	LATIN	2018	DBLP DOI BibTeX RDF
30	Bart M. P. Jansen	On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.	J. Graph Algorithms Appl.	2017	DBLP DOI BibTeX RDF
30	Bart M. P. Jansen	On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.	CoRR	2015	DBLP BibTeX RDF
30	Bart M. P. Jansen	On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT.	WG	2015	DBLP DOI BibTeX RDF
30	Nicolas Bousquet	Hitting sets : VC-dimension and Multicut. (Hitting sets : VC-dimension et Multicut).		2013	RDF
30	Sau-lai Lee, Ivy Yee-man Lau	Hitting a robot vs. hitting a human: is it the same?	HRI	2011	DBLP DOI BibTeX RDF
27	Peter Damaschke	Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets.	COCOA	2008	DBLP DOI BibTeX RDF
27	Peter Bro Miltersen, N. V. Vinodchandran	Derandomizing Arthur-Merlin Games using Hitting Sets.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q17, Subject classification. 68Q15
27	Christopher Umans	Reconstructive Dispersers and Hitting Set Generators.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
27	Devan Sohier, Alain Bui	Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed System.	IPDPS	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.	ACM Trans. Appl. Percept.	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.	SAGA	2009	DBLP DOI BibTeX RDF
23	Amir Shpilka, Ilya Volkovich	Read-once polynomial identity testing.	STOC	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.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
23	Marc Thurley	Kernelizations for Parameterized Counting Problems.	TAMC	2007	DBLP DOI BibTeX RDF
23	Lixin Ding, Yingzhou Bi	About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space.	CIS	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.	J. Comb. Optim.	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.	GECCO	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.	SOFSEM	2004	DBLP DOI BibTeX RDF
23	Astrid Lundmark, Leif Haglund	Adaptive Spatial and Temporal Prefiltering for Video Compression.	SCIA	2003	DBLP DOI BibTeX RDF
23	Naveen Garg 0001, Rohit Khandekar	Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.	FOCS	2002	DBLP DOI BibTeX RDF
23	Luca Trevisan	Non-approximability results for optimization problems on bounded degree instances.	STOC	2001	DBLP DOI BibTeX RDF
23	V. S. Anil Kumar 0001, Sunil Arya, H. Ramesh	Hardness of Set Cover with Intersection 1.	ICALP	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.	ICALP	1999	DBLP DOI BibTeX RDF
21	Abdul Basit 0001, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza	Improving the first selection lemma in R3.	SCG	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.	FCST	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.	SCG	2008	DBLP DOI BibTeX RDF	strong ?-nets, discrete geometry, hitting sets, hypergraph transversals
21	Shai Fine, Yishay Mansour	Active sampling for multiple output identification.	Mach. Learn.	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.	SCG	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.	STOC	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.	Queueing Syst. Theory Appl.	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.	ACM Trans. Model. Comput. Simul.	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.	Queueing Syst. Theory Appl.	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.	J. ACM	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.	ACM Trans. Softw. Eng. Methodol.	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.	J. Comb. Theory, Ser. B	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.	J. Comput. Syst. Sci.	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.	Mach. Learn.	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?	CoRR	2024	DBLP DOI BibTeX RDF
15	Avik Pal, Madhura Pawar	Hitting "Probe"rty with Non-Linearity, and More.	CoRR	2024	DBLP DOI BibTeX RDF
15	P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad	Face-hitting Dominating Sets in Planar Graphs.	CoRR	2024	DBLP DOI BibTeX RDF
15	Yuuho Tanaka	On the average hitting times of Cay(ZN,{+1,+2}).	Discret. Appl. Math.	2024	DBLP DOI BibTeX RDF
15	Tobias Bleifuß, Thorsten Papenbrock, Thomas Bläsius, Martin Schirneck, Felix Naumann	Discovering Functional Dependencies through Hitting Set Enumeration.	Proc. ACM Manag. Data	2024	DBLP DOI BibTeX RDF
15		Correction to: Hitting Times of Random Walks on Edge Corona Product Graphs.	Comput. J.	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.	Comput. J.	2024	DBLP DOI BibTeX RDF
15	Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals	Proving Unsatisfiability with Hitting Formulas.	ITCS	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.	AAAI	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.	J. Intell. Fuzzy Syst.	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.	Int. J. Comput. Sci. Sport	2023	DBLP DOI BibTeX RDF
15	Patrick Rodler	DynamicHS: Streamlining Reiter's Hitting-Set Tree for Sequential Diagnosis.	Inf. Sci.	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.	IEEE Internet Things J.	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.	ACM Trans. Algorithms	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.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF