default search action
John Tsiligaridis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c16]John Tsiligaridis:
Tree-Based Ensemble Models and Algorithms for Classification. ICAIIC 2023: 103-106
2010 – 2019
- 2016
- [c15]John Tsiligaridis, César Flores:
Reducing Energy Consumption for Distributed EM-based Clustering in Wireless Sensor Networks. ANT/SEIT 2016: 313-320 - 2015
- [p1]John Tsiligaridis:
Multiple Sequence Alignment and Clustering with Dot Matrices, Entropy, and Genetic Algorithms. Big Data - Algorithms, Analytics, and Applications 2015: 71-88 - 2014
- [c14]John Tsiligaridis:
Tabu based Search for discovering Regular Plans in mobile clients. DICTAP 2014: 253-257 - [c13]John Tsiligaridis:
A Genetic Algorithm and Tabu Search for Discovering Regular Plans in Mobile Clients. ICSOFT EA 2014: 143-149 - 2013
- [c12]John Tsiligaridis, Fabian Ochoa:
Dot matrices and genetics algorithms for MSA. SummerSim 2013: 48 - 2012
- [c11]John Tsiligaridis:
Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients. DCNET/ICE-B/OPTICS 2012: 69-74 - 2011
- [c10]John Tsiligaridis:
Similar Regular Plans for Mobile Clients. DCNET/OPTICS 2011: 69-74 - [c9]John Tsiligaridis:
Grouping for the Criteria based Data Broadcast in Wireless Mobile Computing. ICSOFT (1) 2011: 203-209
2000 – 2009
- 2008
- [c8]John Tsiligaridis:
A Criteria Based Data Broadcast in Wireless Mobile Computing. HPCNCS 2008: 36-41 - [c7]John Tsiligaridis:
Autonomous Servers for Regular Data Broadcasting in Wireless Mobile Environment. International Conference on Internet Computing 2008: 325-329 - 2007
- [c6]John Tsiligaridis, Raj Acharya:
An Adaptive Data Broadcasting Model in Mobile Information Systems. CISIM 2007: 203-208 - 2006
- [c5]John Tsiligaridis, Raj Acharya:
A Data Allocation Scheme using Data Mining for Wireless Cellular Network. CTS 2006: 117-124 - 2005
- [j2]John Tsiligaridis, Raj Acharya:
Three new approaches for adjustment and improvement of the RR scheduler in a dynamic resource environment. Comput. Commun. 28(8): 929-946 (2005) - [c4]John Tsiligaridis, Raj Acharya:
A clustering prediction scheme for wireless cellular network. CTS 2005: 298-304 - [c3]John Tsiligaridis, Raj Acharya:
A Hybrid Framework of RR Scheduler to Ensure Priority, Low Complexity and Delay with Relative Fairness. ISSADS 2005: 98-117 - [c2]John Tsiligaridis, Raj Acharya:
A Tree Based Data Mining Prediction Scheme for Wireless Cellular Network. ITCC (2) 2005: 784-786 - 2004
- [c1]John Tsiligaridis, Raj Acharya:
Progressive Scheduling Models for Next Generation Networks. Communications in Computing 2004: 213-219 - 2003
- [j1]John Tsiligaridis, Raj Acharya:
A Lightweight Scheme of Differentiated Services for Home Networking. Telecommun. Syst. 23(3-4): 257-271 (2003)
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-25 05:46 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: