default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuoliang Xue
- > Home > Persons > Guoliang Xue
Publications
- 2011
[c85]Guoliang Xue:
Resource allocation in cooperative networks: The role of games. LCN 2011- 2003
- [j43]Guoliang Xue:
Optimal multichannel data transmission in computer networks. Comput. Commun. 26(7): 759-765 (2003) - [j42]Guoliang Xue:
Server cost minimization in a distributed servers architecture for on-demand video services. IEEE Commun. Lett. 7(2): 52-54 (2003) - [j40]Guoliang Xue:
Minimum-cost QoS multicast and unicast routing in communication networks. IEEE Trans. Commun. 51(5): 817-824 (2003) - 2002
- [j36]Guoliang Xue:
An improved random walk model for PCS networks. IEEE Trans. Commun. 50(8): 1224-1226 (2002) - 2001
- [j34]Guoliang Xue:
Handbook of Combinatorial Optimization DingZhu Du and Panos M. Pardalos (co-editors), Kluwer Academic Publishers, 1998, Vols. 1-3, ISBN: 0-7923-5285-8. J. Glob. Optim. 19(4): 1-3 (2001) - [j33]Guoliang Xue:
A cost optimal parallel algorithm for computing force field in N-body simulations on a CREW PRAM. Theor. Comput. Sci. 255(1-2): 555-568 (2001) - [c26]Guoliang Xue:
Optimal lightpath routing and rerouting in WDM networks. GLOBECOM 2001: 2124-2128 - 2000
- [c20]Guoliang Xue:
Optimal Multi-Path End-to-End Data Transmission in Networks. ISCC 2000: 581-586 - 1999
- [c18]Guoliang Xue:
Provably good approximation to minimum cost delay-constrained multicast trees. ICCCN 1999: 610-614 - 1998
- [j18]Guoliang Xue:
End-to-end data paths: quickest or most reliable? IEEE Commun. Lett. 2(6): 156-158 (1998) - [j16]Guoliang Xue:
An O(n) Time Hierarchical Tree Algorithm for Computing Force Field in n-Body Simulations. Theor. Comput. Sci. 197(1-2): 157-169 (1998) - [c12]Guoliang Xue:
A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations. COCOON 1998: 95-104 - 1997
- [j12]Guoliang Xue:
Linear time algorithms for computing the most reliable source on an unreliable tree network. Networks 30(1): 37-45 (1997) - [c10]Guoliang Xue:
A Branch-and-Bound Algorithm for Computing Node Weighted Steiner Minimum Trees. COCOON 1997: 383-392 - 1995
- [j9]Guoliang Xue:
On an open problem in spherical facility location. Numer. Algorithms 9(1): 1-12 (1995) - 1994
- [j7]Guoliang Xue:
Molecular conformation on the CM-5 by parallel two-level simulated annealing. J. Glob. Optim. 4(2): 187-208 (1994) - [j5]Guoliang Xue:
Improvement on the northby algorithm for molecular conformation: Better solutions. J. Glob. Optim. 4(4): 425-440 (1994) - 1993
- [c6]Guoliang Xue:
Parallel Two-Level Simulated Annealing. International Conference on Supercomputing 1993: 357-366 - 1989
- [j1]Guoliang Xue:
On the convergence of one-dimensional simplex search. Comput. Oper. Res. 16(2): 113-116 (1989)
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-09-04 01:20 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:
