Search results for "average time complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Baoliang Xu, Wenjian Luo, Xingxin Pei, Min Zhang, Xufa Wang	On average time complexity of evolutionary negative selection algorithms for anomaly detection.	GEC Summit	2009	DBLP DOI BibTeX RDF	drift analysis, evolutionary negative selection algorithm, anomaly detection, artificial immune system, time complexity
2	Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao	On the analysis of average time complexity of estimation of distribution algorithms.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
2	Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki	Average-Time Complexity of Gossiping in Radio Networks.	SIROCCO	2006	DBLP DOI BibTeX RDF
2	Andreas Jakoby	The Average Time Complexity to Compute Prefix Functions in Processor Networks.	STACS	1999	DBLP DOI BibTeX RDF
1	Tianshi Chen, Jun He, Guangzhong Sun, Guoliang Chen, Xin Yao	A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems.	IEEE Transactions on Systems, Man, and Cybernetics, Part B	2009	DBLP DOI BibTeX RDF
1	Eric Rivals, Leena Salmela, Petteri Kiiskinen, Petri Kalsi, Jorma Tarhio	mpscan: Fast Localisation of Multiple Reads in Genomes.	WABI	2009	DBLP DOI BibTeX RDF
1	Amos Korman, David Peleg	Dynamic routing schemes for graphs with low local density.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	distributed algorithms, dynamic networks, Routing schemes
1	Feng Hu, Guoyin Wang	Huge Data Mining Based on Rough Set Theory and Granular Computing.	Web Intelligence/IAT Workshops	2008	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Laura Giambruno, Cyril Nicaud	The Average State Complexity of the Star of a Finite Set of Words Is Linear.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
1	Feng Hu, Guoyin Wang, Lin Feng	Fast Knowledge Reduction Algorithms Based on Quick Sort.	RSKT	2008	DBLP DOI BibTeX RDF	Huge data, Quick sort, Rough set, Divide and conquer, Knowledge reduction
1	Haibin Ling, Kazunori Okada	An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	histogram-based descriptor, interest point matching, shape matching, SIFT, transportation problem, Earth Mover's Distance, shape context, spin image
1	Brecht Wyseur, Wil Michiels, Paul Gorissen, Bart Preneel	Cryptanalysis of White-Box DES Implementations with Arbitrary External Encodings.	Selected Areas in Cryptography	2007	DBLP DOI BibTeX RDF	White-Box Cryptography, Cryptanalysis, DES, Data Encryption Standard, Obfuscation
1	Qinqi Wang, Ming Xu, Xingui He	On Estimating Path Capacity in Wireless Mesh Networks.	UIC	2007	DBLP DOI BibTeX RDF
1	Shui Chao, Li Hui, Liu Feng, Jia Yan	Node clustering in the P2P environment.	ICN/ICONS/MCL	2006	DBLP DOI BibTeX RDF
1	Yangjun Chen, Yibin Chen	On the Signature Tree Construction and Analysis.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	bit-slice files, S-trees, signature trees, information retrieval, Signature files
1	Srecko Brlek, Elisa Pergola, Olivier Roques	Non uniform random generation of generalized Motzkin paths.	Acta Inf.	2006	DBLP DOI BibTeX RDF	Generalized Motzkin path, Random generation, Rejection
1	Katerina Asdre, Stavros D. Nikolopoulos	P-Tree Structures and Event Horizon: Efficient Event-Set Implementations.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	event set algorithms, hold model, event horizon, P-tree structures, data structures, discrete-event simulation, heap, P-tree
1	Dougu Nam, Seunghyun Seo, Sangsoo Kim	An efficient top-down search algorithm for learning Boolean networks of gene expression.	Machine Learning	2006	DBLP DOI BibTeX RDF	Random superset selection, Core search, Coupon collection problem, Data consistency, Boolean network
1	C. González, A. Ramírez, José Antonio Lozano, Pedro Larrañaga	Average Time Complexity of Estimation of Distribution Algorithms.	IWANN	2005	DBLP DOI BibTeX RDF
1	Katerina Asdre, Stavros D. Nikolopoulos	P-tree structures and event horizon: efficient event-set implementations.	Winter Simulation Conference	2005	DBLP DOI BibTeX RDF
1	Marc R. C. van Dongen	Saving Support-Checks Does Not Always Save Time.	Artif. Intell. Rev.	2004	DBLP DOI BibTeX RDF	maintain arc-consistency, Abbrevations:, CSP - constraint satisfaction problem, MAC - maintain arc consistency, RLFAP - radio link frequency assignment problem, search, heuristics, constraint satisfaction, time-complexity, space-complexity
1	Jun He, Xin Yao	Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85].	Artif. Intell.	2002	DBLP DOI BibTeX RDF
1	Xiaohong Jiang, Hong Shen, Md. Mamun-ur-Rashid Khandker, Susumu Horiguchi	A New Scheme to Realize Crosstalk-free Permutations in Optical MINs with Vertical Stacking. (PDF / PS)	ISPAN	2002	DBLP DOI BibTeX RDF
1	Marc R. C. van Dongen	Domain-Heuristics for Arc-Consistency Algorithms.	International Workshop on Constraint Solving and Constraint Logic Programming	2002	DBLP DOI BibTeX RDF
1	Punit Chandra, Ajay D. Kshemkalyani	Detection of Orthogonal Interval Relations.	HiPC	2002	DBLP DOI BibTeX RDF
1	Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey	Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline.	NETWORKING	2002	DBLP DOI BibTeX RDF
1	Jun He, Xin Yao	Drift analysis and average time complexity of evolutionary algorithms.	Artif. Intell.	2001	DBLP DOI BibTeX RDF
1	Marc R. C. van Dongen	A Theoretical Analysis of the Average-Time Complexity of Domain-Heuristics for Arc-Consistency Algorithms.	JFPLC	2001	DBLP BibTeX RDF
1	Han Kesong, Yongcheng Wang, Guilin Chen	Research on a faster algorithm for pattern matching.	IRAL	2000	DBLP DOI BibTeX RDF	Boyer-Moore algorithm, quick search algorithm, pattern matching, time complexity
1	Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou	Locating Information with Uncertainty in Fully Interconnected Networks.	DISC	2000	DBLP DOI BibTeX RDF	Information Retrieval, Search, Uncertainty, Random Walks, Complete Network
1	Igor Chikalov	On Average Time Complexity of Decision Trees and Branching Programs.	Fundam. Inform.	1999	DBLP DOI BibTeX RDF
1	Jin-yi Cai, Alan L. Selman	Fine Separation of Average-Time Complexity Classes.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Jay Belanger, Aduri Pavan, Jie Wang	Reductions Do Not Preserve Fast Convergence Rates in Average Time.	Algorithmica	1999	DBLP DOI BibTeX RDF	Average polynomial time, Distributional problem, Reductions
1	Guoliang Xue, Ding-Zhu Du	An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology.	Algorithmica	1999	DBLP DOI BibTeX RDF	Shortest network under a given topology, Analysis of algorithms, Steiner minimum trees
1	Jin-yi Cai, Alan L. Selman	Fine Separation of Average Time Complexity Classes.	STACS	1996	DBLP DOI BibTeX RDF
1	Jin-yi Cai, Alan L. Selman	Average Time Complexity Classes	Electronic Colloquium on Computational Complexity (ECCC)	1995	DBLP BibTeX RDF
1	Jun Gu, Qian-Ping Gu	Average Time Complexity of the SAT 1.2 Algorithm.	ISAAC	1994	DBLP DOI BibTeX RDF
1	Qian-Ping Gu, Jun Gu	Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	average time bounds, mesh-connectedcomputer, wraparound connections, distancebound, indexing schemes, average time complexity, parallel algorithms, parallel algorithms, computational complexity, multiprocessor interconnection networks, sorting, sorting, communication complexity, queue size, parallel sorting algorithms
1	Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson	A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance.	STACS	1991	DBLP DOI BibTeX RDF
1	Ewald Speckenmeyer, Rainer Kemp	On the Average Time Complexity of Set Partitioning.	CSL	1989	DBLP DOI BibTeX RDF
1	Marina Roesler, Walter A. Burkhard	Deadlock Resolution and Semantic Lock Models in Object-Oriented Distributed Systems.	SIGMOD Conference	1988	DBLP DOI BibTeX RDF
1	Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini	Analysis of a Class of Algorithms for Problems on Trace Languages.	AAECC	1986	DBLP DOI BibTeX RDF
1	Paul G. Spirakis, Athanasios K. Tsakalidis	A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph.	ICALP	1986	DBLP DOI BibTeX RDF