default search action
Panlop Zeephongsekul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j25]Osama Alamri, Babak Abbasi
, James P. Minas
Service level agreements: ready-rate analysis with lump-sum and linear penalty structures. J. Oper. Res. Soc. 69(1): 142-155 (2018) - 2017
- [j24]Vidhyashree Nagaraju
Performance Optimized Expectation Conditional Maximization Algorithms for Nonhomogeneous Poisson Process Software Reliability Models. IEEE Trans. Reliab. 66(3): 722-734 (2017) - 2016
- [j23]Lance Fiondella, Panlop Zeephongsekul:
Trivariate Bernoulli distribution with application to software fault tolerance. Ann. Oper. Res. 244(1): 241-255 (2016) - [j22]Panlop Zeephongsekul, Chathuri L. Jayasinghe, Lance Fiondella, Vidhyashree Nagaraju
Maximum-Likelihood Estimation of Parameters of NHPP Software Reliability Models Using Expectation Conditional Maximization Algorithm. IEEE Trans. Reliab. 65(3): 1571-1583 (2016) - [c24]Eidah J. Alzahrani
SLA-Aware Resource Scaling for Energy Efficiency. HPCC/SmartCity/DSS 2016: 852-859 - 2014
- [j21]Malith Jayasinghe, Zahir Tari
ADAPT-POLICY: Task Assignment in Server Farms when the Service Time Distributionof Tasks is Not Known A Priori. IEEE Trans. Parallel Distributed Syst. 25(4): 851-861 (2014) - [j20]Vidura Gamini Abhaya, Zahir Tari
Performance Analysis of EDF Scheduling in a Multi-Priority Preemptive M/G/1 Queue. IEEE Trans. Parallel Distributed Syst. 25(8): 2149-2158 (2014) - 2013
- [j19]Sergei Yu. Schreider
Game theoretic approach for fertilizer application: looking for the propensity to cooperate. Ann. Oper. Res. 206(1): 385-400 (2013) - [j18]Chathuri L. Jayasinghe, Panlop Zeephongsekul:
Local Polynomial Fitting of the Mean Residual Life Function. IEEE Trans. Reliab. 62(2): 317-328 (2013) - 2011
- [j17]Seyedeh Zahra Hosseinifard
Application of artificial neural networks in linear profile monitoring. Expert Syst. Appl. 38(5): 4920-4928 (2011) - [j16]Malith Jayasinghe, Zahir Tari
Task assignment in multiple server farms using preemptive migration and flow control. J. Parallel Distributed Comput. 71(12): 1608-1621 (2011) - [c23]Lasitha Sandamali Dharmasena
Software Reliability Growth Models Based on Local Polynomial Modeling with Kernel Smoothing. ISSRE 2011: 220-229 - 2010
- [j15]Lasitha Sandamali Dharmasena
Estimating Process Capability Index CPM Using a Bootstrap Sequential Sampling Procedure. Commun. Stat. Simul. Comput. 39(6): 1097-1110 (2010) - [c22]Malith Jayasinghe, Zahir Tari
Performance Analysis of Multi-level Time Sharing Task Assignment Policies on Cluster-Based Systems. CLUSTER 2010: 265-274 - [c21]Malith Jayasinghe, Zahir Tari
A scalable Multi-Tier Task Assignment Policy with Minimum Excess Load. ISCC 2010: 913-918 - [c20]Malith Jayasinghe, Zahir Tari
Multi-level Multi-server Task Assignment with Work-Conserving Migration. NCA 2010: 178-181
2000 – 2009
- 2009
- [j14]Maryam Esmaeili
A game theory approach in seller-buyer supply chain. Eur. J. Oper. Res. 195(2): 442-448 (2009) - [j13]Jianhong Cecilia Xia
Modelling spatio-temporal movement of tourists using finite Markov chains. Math. Comput. Simul. 79(5): 1544-1553 (2009) - [c19]Malith Jayasinghe, Zahir Tari
The Impact of Quanta on the Performance of Multi-level Time Sharing Policy under Heavy-tailed Workloads. ACSC 2009: 83-91 - [c18]Shafiq Ahmad, Md. Shamsul Huda, Sujak Bakir, Mali Abdollahian, Panlop Zeephongsekul:
Process Performance Evaluation Using Evolutionary Algorithm. IKE 2009: 731-737 - [c17]Malith Jayasinghe, Zahir Tari
On the performance of multi-level time sharing policy under heavy-tailed workloads. ISCC 2009: 956-962 - [p1]Panlop Zeephongsekul:
A Fuzzy Set Approach to Software Reliability Modeling. Foundations of Computational Intelligence (2) 2009: 111-131 - 2008
- [c16]Shafiq Ahmad, Asef Nazari, Mali Abdollahian, Panlop Zeephongsekul:
Fitting Burr XII Distribution to Continuous Positive Data Using Hybrid Search Method. IKE 2008: 546-552 - 2007
- [j12]Peter Dimopoulos, Panlop Zeephongsekul, Zahir Tari
A dynamic priority approach to reducing delay in interactive TCP connections. Telecommun. Syst. 34(1-2): 59-70 (2007) - [c15]Shafiq Ahmad, Mali Abdollahian, Panlop Zeephongsekul:
Non-Normal Process Capability Evaluation. IKE 2007: 321-326 - [c14]Shafiq Ahmad, Mali Abdollahian, Panlop Zeephongsekul:
Process Capability Analysis for a Skewed Population Data. IKE 2007: 327-333 - [c13]James Broberg, Panlop Zeephongsekul, Zahir Tari
Approximating Bounded General Service Distributions. ISCC 2007: 817-823 - [c12]Shafiq Ahmad
Process Capability for a Non-Normal Quality Characteristics Data. ITNG 2007: 420-424 - [c11]Shafiq Ahmad
Process Capability Analysis for Non-Normal Quality Characteristics Using Gamma Distribution. ITNG 2007: 425-430 - 2006
- [j11]Panlop Zeephongsekul, Anthony Bedford:
Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline. Eur. J. Oper. Res. 172(3): 886-908 (2006) - [j10]James Broberg, Zahir Tari
Task assignment with work-conserving migration. Parallel Comput. 32(11-12): 808-830 (2006) - [c10]Peter Dimopoulos, Panlop Zeephongsekul, Zahir Tari
Multipath Aware TCP (MATCP). ISCC 2006: 981-988 - 2005
- [j9]Anthony Bedford, Panlop Zeephongsekul:
On a dual queueing system with preemptive priority service discipline. Eur. J. Oper. Res. 161(1): 224-239 (2005) - [c9]Panu Phinjaroenphan, Savitri Bevinakoppa, Panlop Zeephongsekul:
A Method for Estimating the Execution Time of a Parallel Task on a Grid Node. EGC 2005: 226-236 - [c8]Panu Phinjaroenphan, Savitri Bevinakoppa, Panlop Zeephongsekul:
A Heuristic Algorithm for Mapping Parallel Applications on Computational Grids. EGC 2005: 1086-1096 - [c7]Peter Dimopoulos, Panlop Zeephongsekul, Zahir Tari
Reducing the user perceived delay of interactive TCP connections using a dynamic priority approach. ICCCN 2005: 421-427 - [c6]Jens A. Andersson, Panlop Zeephongsekul:
Shaping Variables in Service Level Agreements at Application Level. MASCOTS 2005: 299-306 - 2004
- [j8]Anthony Bedford, Panlop Zeephongsekul:
Quality of service in networks with prioritised traffic involving the multi-priority dual queue. Int. J. Comput. Eng. Sci. 5(2): 303-313 (2004) - [c5]Natthaphan Boonyanunta, Panlop Zeephongsekul:
Predicting the Relationship Between the Size of Training Sample and the Predictive Power of Classifiers. KES 2004: 529-535 - [c4]Peter Dimopoulos, Panlop Zeephongsekul, Zahir Tari
Modeling the Burstiness of TCP. MASCOTS 2004: 175-183 - [c3]James Broberg, Zahir Tari, Panlop Zeephongsekul:
Task Assignment Based on Prioritising Traffic Flows. OPODIS 2004: 415-430 - 2003
- [c2]Anthony Bedford, Panlop Zeephongsekul:
Simulation Studies of a Multi-priority Dual Queue (MPDQ) with Preemptive and Non-preemptive Scheduling. International Conference on Computational Science 2003: 179-189 - [c1]Natthaphan Boonyanunta, Panlop Zeephongsekul:
Improving the Predictive Power of AdaBoost: A Case Study in Classifying Borrowers. IEA/AIE 2003: 674-685 - 2002
- [j7]Houman Younessi, Panlop Zeephongsekul, Winai Bodhisuwan
A General Model of Unit Testing Efficacy. Softw. Qual. J. 10(1): 69-92 (2002) - 2001
- [j6]Panlop Zeephongsekul:
On the variability of fuzzy debugging. Fuzzy Sets Syst. 123(1): 29-38 (2001)
1990 – 1999
- 1996
- [j5]Panlop Zeephongsekul, Guolin Xia:
On fuzzy debugging of software programs. Fuzzy Sets Syst. 83(2): 239-247 (1996)
1980 – 1989
- 1981
- [j4]Panlop Zeephongsekul:
Almost total information convergence of order alpha for a sequence of point processes. IEEE Trans. Inf. Theory 27(3): 381-383 (1981) - 1980
- [j3]Panlop Zeephongsekul:
A Note on the Upper Bound for the Difference between Two Entropies. Inf. Control. 45(1): 34-36 (1980) - [j2]Panlop Zeephongsekul:
Generalized entropy of deleted point processes. Inf. Sci. 20(2): 115-125 (1980)
1970 – 1979
- 1978
- [j1]Panlop Zeephongsekul:
Some results concerning the entropy of a point process. Inf. Sci. 16(3): 151-156 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: