default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 313 matches
- 2011
- Michael Opoku Agyeman, Ali Ahmadinia:
Optimising Heterogeneous 3D Networks-on-Chip. PARELEC 2011: 25-30 - Berislav Andrlic:
Competitive Advantages of the Adoption and Use of Technological Systems in Hospitality Marketing: The Case Study of Croatia. PARELEC 2011: 139-144 - Bahman Arasteh, Mohammad Javad Hosseini:
A Dependable and Efficient Scheduling Model for Critical Applications on Grid Systems. PARELEC 2011: 79-86 - Ezendu Ariwa, Erica McBain:
Green Pedagogy and Digital Diversity for Multilingualism (with respect to Internet Banking in Universities in the UK). PARELEC 2011: 145-152 - Ezendu Ariwa, Okeoma John-Paul Okeke:
Green Technology and Corporate Sustainablility in Developing Economies. PARELEC 2011: 153-160 - Janusz Borkowski:
Increasing Query Speed with Multithreaded Data Prefetching. PARELEC 2011: 117-122 - Jürgen Bregenzer, Julian Hartmann:
An Approach towards Automation Firmware Modeling for an Exploration and Evaluation of Efficient Parallelization Alternatives. PARELEC 2011: 13-18 - James Dooley, Christian Wagner, Hani Hagras, Gaëtan Pruvost:
FollowMe: The Persistent GUI. PARELEC 2011: 123-126 - Guitao Fu, Zuocheng Xing, Tianlei Zhao, Xiantuo Tang:
Design and Evaluation of Traffic Filter for Token Protocol. PARELEC 2011: 67-72 - Savitri Galih, Trio Adiono, Adit Kurniawan, Iskandar:
Folding Memory Shared Processor Array (FMSPA) Architecture for Channel Estimation of Downlink OFDMA IEEE 802.16e System. PARELEC 2011: 173-178 - Ang Gao, Kenneth Rea, Michel P. Schellekens:
Static Average Case Analysis Fork-Join Framework Programs Based on MOQA Method. PARELEC 2011: 1-6 - F. Furman Haddix:
Trade-offs in Token Ring Systems. PARELEC 2011: 189-194 - Risto Honkanen, Ville Leppänen:
Balanced WDM and TDM Routing in Coloured Sparse Optical Tori. PARELEC 2011: 62-66 - Saiyedul Islam, Raghav Tandon, Shashank Singh, Alok Misra:
A Highly Scalable Solution of an NP-Complete Problem Using CUDA. PARELEC 2011: 93-98 - Andrzej Jordan, Carsten Maple, Ryszard Szczebiot, Lukasz Swierczewski:
Optimal Placement of Wind Generators in Medium Voltage Power Grids - Investigations of Genetic Algorithm. PARELEC 2011: 46-49 - Andrzej Jordan, Ryszard Szczebiot, Carsten Maple, Slawomir Cieslik:
Optimal Placement of the Wind Generators in the Medium Voltage Power Grid. PARELEC 2011: 42-45 - Khursheed Khursheed, Muhammad Imran, Abdul Waheed Malik, Mattias O'Nils, Najeem Lawal, Benny Thörnberg:
Exploration of Tasks Partitioning between Hardware Software and Locality for a Wireless Camera Based Vision Sensor Node. PARELEC 2011: 127-132 - Adrie Kooijman, Joris S. M. Vergeest:
GPU Implementation of the LFT Shape Matching Algorithm. PARELEC 2011: 111-116 - Daniel Lamch, Roman Wyrzykowski:
An Approach for Specification and Testing of Stateful Grid Services. PARELEC 2011: 167-172 - Tiziano Leidi, Thierry Heeb, Marco Colla, Jean-Philippe Thiran:
Event-driven Scheduling for Parallel Stream Processing. PARELEC 2011: 36-41 - Ala Mahdavi, Amir Mansour Pezeshk:
A Fast Enhanced Algorithm of PRI Transform. PARELEC 2011: 179-184 - Mounir Marrakchi:
Optimality for Parallel Point-wise and Block-wise Resolution of a Triangular System on Homogeneous Environments. PARELEC 2011: 161-166 - Sascha Mayer, Bernd Tibken, Sascha Warthenpfuhl:
Parallel Computation of Domains of Attraction for Nonlinear Dynamic Systems. PARELEC 2011: 87-92 - Nicholas McLauchlan, Nik Bessis:
Towards Remote Monitoring of Power Use: A Case for Smart Meters. PARELEC 2011: 133-138 - Maciej Mlynski:
Goal-oriented Adaptive Workload Management for Irregular Applications. PARELEC 2011: 56-61 - Vivek S. Nittoor, Reiji Suda:
Parallelizing a Coarse Grain Graph Search Problem Based upon LDPC Codes on a Supercomputer. PARELEC 2011: 7-12 - Fadi N. Sibai, Hashir Karim Kidwai:
Parallel Orthomin Equation Solver on the Cell Broadband Engine. PARELEC 2011: 105-110 - Adam Smyk, Marek S. Tudruj:
Parallel FDTD Computations Optimized by Genetic Algorithms. PARELEC 2011: 99-104 - Jean-Charles Tournier, Vaibhav Donde, Zhao Li:
Potential of General Purpose Graphic Processing Unit for Energy Management System. PARELEC 2011: 50-55 - Marek S. Tudruj, Janusz Borkowski, Damian Kopanski, Adam Smyk, Eryk Laskowski, Lukasz Masko:
Distributed Program Control Flow and Behaviour Governed by Global States Monitoring. PARELEC 2011: 73-78
skipping 283 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-24 16:45 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint