B. John Oommen - Citegraph

Author Info

Name	Affiliation	Papers
B. JOHN OOMMEN	Carleton Univ, Sch Comp Sci, Ottawa, ON, Canada	42
Collaborators	Citations	PageRank
43	759	143.24
Referers	Referees	References
623	531	495

Search Limit

100623

Publications (42 rows)

Collaborators (43 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A Novel Strategy for Solving the Stochastic Point Location Problem Using a Hierarchical Searching Scheme	18	0.79	2014
On Utilizing Stochastic Non-linear Fractional Bin Packing to Resolve Distributed Web Crawling	0	0.34	2014
Modeling the “learning process” of the teacher in a tutorial-like system using learning automata.	10	0.50	2013
Learning-Automaton-Based Online Discovery and Tracking of Spatiotemporal Event Patterns	10	0.51	2013
Anomaly detection using weak estimators	0	0.34	2011
Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata	23	0.91	2010
Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution	54	1.63	2010
An adaptive learning-like solution of random early detection for congestion avoidance in computer networks	1	0.36	2009
Anomaly Detection in Dynamic Social Systems Using Weak Estimators	3	0.43	2009
Using learning automata to model a student-classroom interaction in a tutorial-like system	3	0.40	2007
Desynchronizing a Chaotic Pattern Recognition Neural Network to Model Inaccurate Perception	11	0.86	2007
Parameter learning from stochastic teachers and stochastic compulsive liars.	24	1.10	2006
Benchmarking attribute cardinality maps for database systems using the TPC-D specifications.	3	0.45	2003
A self-organizing method for map reconstruction	0	0.34	2003
Discretized learning automata solutions to the capacity assignment problem for prioritized networks.	14	0.67	2002
On optimal pairwise linear classifiers for normal distributions: the two-dimensional case	17	1.08	2002
Generalized pursuit learning schemes: new families of continuous and discretized learning automata	67	2.58	2002
Enhanced static Fano coding	0	0.34	2001
Histogram methods in query optimization: the relation between accuracy and optimality	0	0.34	2001
On the pattern recognition of noisy subsequence trees	5	0.82	2001
Continuous and discretized pursuit learning schemes: various algorithms and their comparison.	74	3.22	2001
Continuous learning automata solutions to the capacity assignment problem	52	2.43	2000
Discrete vector quantization for arbitrary distance function estimation.	1	0.35	1998
String taxonomy using learning automata.	20	3.01	1997
Stochastic searching on the line and its applications to parameter learning in nonlinear optimization.	41	1.95	1997
Arbitrary distance function estimation using discrete vector quantization	0	0.34	1997
Switching models for nonstationary random environments	2	0.41	1995
SEATER: an object-oriented simulation environment using learning automata for telephone traffic routing	1	0.47	1994
Adaptive structuring of binary search trees using conditional rotations	26	66.35	1993
Breaking substitution cyphers using stochastic automata	4	0.57	1993
Recognizing sources of random strings	2	2.19	1991
An adaptive learning solution to the keyboard optimization problem	11	0.97	1991
Discretized pursuit learning automata	81	5.57	1990
Epsilon-optimal stubborn learning mechanisms	0	0.34	1990
On using distribution theory to prove the epsilon-optimality of stubborn learning mechanisms	0	0.34	1989
Deterministic learning automata solutions to the equipartitioning problem	67	9.14	1988
On terrain acquisition by a point robot amidst polyhedral obstacles	28	19.48	1988
Ergodic Learning Automata Capable of Incorporating a Priori Information	7	1.19	1987
Recognition of noisy subsequences using constrained edit distances.	34	4.97	1987
On translating ellipses amidst elliptic obstacles	5	0.80	1986
A Learning Automaton Solution to the Stochastic Minimum-Spanning Circle Problem	10	0.99	1986
The asymptotic optimality of discretized linear reward-inaction learning automata	30	3.39	1984