Shaharuddin Salleh

Orcid: 0000-0003-3646-108X

According to our database1, Shaharuddin Salleh authored at least 40 papers between 1996 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Computer forensic problem of sample size in file type analysis.
Int. J. Adv. Intell. Paradigms, 2018

2017
Solving Priority-Based Target Coverage Problem in Directional Sensor Networks with Adjustable Sensing Ranges.
Wirel. Pers. Commun., 2017

2015
Scheduling algorithms for extending directional sensor network lifetime.
Wirel. Networks, 2015

A new learning automata-based approach for maximizing network lifetime in wireless sensor networks with adjustable sensing ranges.
Neurocomputing, 2015

2014
A Learning Automata-Based Solution to the Priority-Based Target Coverage Problem in Directional Sensor Networks.
Wirel. Pers. Commun., 2014

Solving Target Coverage Problem Using Cover Sets in Wireless Sensor Networks Based on Learning Automata.
Wirel. Pers. Commun., 2014

A new method for evaluating decision making units in DEA.
J. Oper. Res. Soc., 2014

Heuristic methods to maximize network lifetime in directional sensor networks with adjustable sensing ranges.
J. Netw. Comput. Appl., 2014

An extended partitioning technique to transform trees into single-row networks.
Appl. Soft Comput., 2014

Local coverage measurement algorithm in GPS-free wireless sensor networks.
Ad Hoc Networks, 2014

A New Learning Automata-Based Algorithm to the Priority-Based Target Coverage Problem in Directional Sensor Networks.
Proceedings of the Mobile Networks and Management - 6th International Conference, 2014

2013
Learning Automata-Based Algorithms for Solving the Target Coverage Problem in Directional Sensor Networks.
Wirel. Pers. Commun., 2013

Learning automata-based algorithms for finding cover sets in wireless sensor networks.
J. Supercomput., 2013

A learning automata-based algorithm for solving coverage problem in directional sensor networks.
Computing, 2013

A note on integer-valued radial model in DEA.
Comput. Ind. Eng., 2013

A learning automata-based solution to the target coverage problem in wireless sensor networks.
Proceedings of the 11th International Conference on Advances in Mobile Computing & Multimedia, 2013

2012
EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET.
J. Supercomput., 2012

Using Media Independent Handover to Support PMIPv6 Inter-domain Mobility Based Vehicular Networks.
Int. J. Commun. Networks Inf. Secur., 2012

2011
Towards probabilistic arbitration in sensors integration.
Int. J. Pervasive Comput. Commun., 2011

Neighborhood discovery in a wireless sensor networks.
Proceedings of the MoMM'2011, 2011

Ad-hoc network design with multiple metrics using Taguchi's loss function.
Proceedings of the International Conference on Electrical Engineering and Informatics, 2011

2010
A Probabilistic Routing Protocol in VANET.
Int. J. Mob. Comput. Multim. Commun., 2010

A distributed probabilistic arbitration in sensors integration.
Proceedings of the MoMM'2010, 2010

2009
Dynamic Single-Row Routing Technique for Channel Assignments.
Proceedings of the Sixth International Conference on Information Technology: New Generations, 2009

Real-Time Divisible Load Theory: A Perspective.
Proceedings of the ICPPW 2009, 2009

2008
Emergent behavior in massively-deployed sensor networks.
Mob. Inf. Syst., 2008

2007
Single-row mapping and transformation of connected graphs.
J. Supercomput., 2007

Hybrid training with binary search protocol for wireless sensor networks.
Mob. Inf. Syst., 2007

On Asynchronous Training in Sensor Networks.
J. Mobile Multimedia, 2007

A deadline-based algorithm for dynamic task scheduling with precedence constraints.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2007

2006
SPLAI: Computational finite element model for sensor networks.
Mob. Inf. Syst., 2006

On the probability of route existence in mobile wireless networks.
Int. J. Simul. Process. Model., 2006

FRECAST: message transmission model in dense graphs for ad hoc networks.
Int. J. Simul. Process. Model., 2006

Multi-training sensor networks with bipartite conflict graphs.
Proceedings of the First International Workshop on Middleware for Sensor Networks, 2006

2005
Single-Row Transformation of Complete Graphs.
J. Supercomput., 2005

2003
A Neural Network Model for the Common Due Date Job Scheduling on Unrelated Parallel Machines.
Int. J. Comput. Math., 2003

2002
Enhanced Simulated Annealing Technique for the Single-Row Routing Problem.
J. Supercomput., 2002

1998
Multiprocessor scheduling using mean-field annealing.
Future Gener. Comput. Syst., 1998

1997
Mapping the Single-Row Routing Problem to a Hypercube.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

1996
A Mean-Field Annealing Model for Task Scheduling in Multiprocessor Systems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996


  Loading...