default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWan-Chen Lu
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c8]Chin-Hua Tsai, Jing-Kai Lou, Wan-Chen Lu, Shou-De Lin
:
Exploiting rank-learning models to predict the diffusion of preferences on social networks. ASONAM 2014: 265-272- [c7]Wei-Shih Lin, Tsung-Ting Kuo, Yu-Yang Huang, Wan-Chen Lu, Shou-De Lin:
A Transfer-Learning Approach to Exploit Noisy Information for Classification and Its Application on Sentiment Detection. TAAI 2014: 262-273 - 2010
- [j7]Hsin-Wen Wei, Wan-Chen Lu, Pei-Chi Huang, Wei-Kuan Shih, Ming-Yang Kao:
Testing Whether a Set of Code Words Satisfies a Given Set of Constraints. J. Inf. Sci. Eng. 26(2): 333-346 (2010)
2000 – 2009
- 2009
- [j6]Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-sheng Hsu:
Smallest Bipartite Bridge-Connectivity Augmentation. Algorithmica 54(3): 353-378 (2009) - [j5]Jia-Ming Chen, Wan-Chen Lu, Wei-Kuan Shih, Ming-Chung Tang:
Imprecise Computations with Deferred Optional Tasks. J. Inf. Sci. Eng. 25(1): 185-200 (2009) - 2008
- [j4]Hsin-Wen Wei, Kwei-Jay Lin, Wan-Chen Lu, Wei-Kuan Shih:
Generalized rate monotonic schedulability bounds using relative period ratios. Inf. Process. Lett. 107(5): 142-148 (2008) - [j3]Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, Wei-Kuan Shih:
Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values. IEEE Trans. Computers 57(5): 648-659 (2008) - 2007
- [j2]Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, Wei-Kuan Shih:
Rate monotonic schedulability tests using period-dependent conditions. Real Time Syst. 37(2): 123-138 (2007) - [c6]Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-sheng Hsu:
Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract). AAIM 2007: 153-166 - [c5]Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, Wei-Kuan Shih:
New Schedulability Conditions for Real-Time Multiframe Tasks. ECRTS 2007: 39-50 - [c4]Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, Wei-Kuan Shih:
Period-Dependent Initial Values for Exact Schedulability Test of Rate Monotonic Systems. IPDPS 2007: 1-8 - 2006
- [j1]Wan-Chen Lu, Jen-Wei Hsieh, Wei-Kuan Shih, Tei-Wei Kuo:
A faster exact schedulability analysis for fixed-priority scheduling. J. Syst. Softw. 79(12): 1744-1753 (2006) - [c3]Wan-Chen Lu, Hsin-Wen Wei, Kwei-Jay Lin:
Rate Monotonic Schedulability Conditions Using Relative Period Ratios (Abstract). RTCSA 2006: 3-9 - [c2]Wan-Chen Lu, Jen-Wei Hsieh, Wei-Kuan Shih:
A precise schedulability test algorithm for scheduling periodic tasks in real-time systems. SAC 2006: 1451-1455 - 2005
- [c1]Pei-Chi Huang, Wan-Chen Lu, Chun-Nan Chou, Wei-Kuan Shih:
The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System. RTCSA 2005: 260-265
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-25 05:39 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:
