default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 117
Volume 117, January 2017
- Georg von der Brüggen
, Jian-Jia Chen, Robert I. Davis, Wen-Hung Huang:
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling. 1-5 - Wojciech Widel:
Clique-heavy subgraphs and pancyclicity of 2-connected graphs. 6-9 - Dongjin Yu, Yunlei Mu, Yike Jin:
Rating prediction using review texts with underlying sentiments. 10-18 - Bo Zhang, Qianmu Li, Yuanyuan Ma:
Research on dynamic heuristic scanning technique and the application of the malicious code detection model. 19-24 - S. Sasikala, S. Appavu alias Balamurugan, S. Geetha:
A novel adaptive feature selector for supervised classification. 25-34 - Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim:
Simple DFS on the complement of a graph and on partially complemented digraphs. 35-39 - Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit:
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs. 40-44 - Félix Carvalho Rodrigues, Eduardo Candido Xavier:
Non-cooperative capacitated facility location games. 45-53
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.
last updated on 2025-02-27 22:45 CET 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:
