Hamiltonian cycles in solid grid graphs

C Umans, W Lenhart - Proceedings 38th Annual Symposium …, 1997 - ieeexplore.ieee.org
A grid graph is a finite node induced subgraph of the infinite two dimensional integer grid. A
solid grid graph is a grid graph without holes. For general grid graphs, the Hamiltonian cycle …

Embedding of cycles and grids in star graphs

JS Jwo, S Lakshmivarahan, SK Dhall - Journal of Circuits, Systems …, 1991 - World Scientific
The use of the star graph as a viable interconnection scheme for parallel computers has
been examined by a number of authors in recent times. An attractive feature of this class of …

BIoTope: building an IoT open innovation ecosystem for smart cities

A Javed, S Kubler, A Malhi, A Nurminen, J Robert… - IEEE …, 2020 - ieeexplore.ieee.org
The Internet of Things (IoT) has led towards a digital world in which everything becomes
connected. Unfortunately, most of the currently marketed connected devices feed vertically …

A probabilistic approach for web service discovery

C Li, R Zhang, J Huai, X Guo… - 2013 IEEE International …, 2013 - ieeexplore.ieee.org
Web service discovery is a vital problem in service computing with the increasing number of
services. Existing service discovery approaches merely focus on WSDL-based keyword …

Using concept maps and concept questions to enhance conceptual understanding

DL Darmofal, DH Soderholm… - 32nd annual frontiers in …, 2002 - ieeexplore.ieee.org
Conceptual understanding is the ability to apply knowledge across a variety of instances or
circumstances. Several strategies can be used to teach and assess concepts, eg, inquiry …

A web service search engine for large-scale web service discovery based on the probabilistic topic modeling and clustering

A Bukhari, X Liu - Service Oriented Computing and Applications, 2018 - Springer
With the ever increasing number of Web services, discovering an appropriate Web service
requested by users has become a vital yet challenging task. We need a scalable and …

The tomaco hybrid matching framework for SAWSDL semantic web services

TG Stavropoulos, S Andreadis… - IEEE Transactions …, 2015 - ieeexplore.ieee.org
This work aims to advance Web Service retrieval, also known as Matching, in two directions.
First, it introduces a matching algorithm for SAWSDL, which adapts and extends known …

Topic-based crossing-workflow fragment discovery

Z Zhou, J Wen, Y Wang, X Xue, PCK Hung… - Future Generation …, 2020 - Elsevier
Along with the large and increasing number of scientific workflows publicly accessible on
Web repositories, the discovery of workflow fragments is significant to promote the reuse or …

Contextual service discovery using term expansion and binding coverage analysis

SP Ma, CW Lan, CH Li - Future Generation Computer Systems, 2015 - Elsevier
Business cloud emerges as a new solution for providing on-demand business services over
Internet. Standardized service technologies drive widespread adoption of clouds and enable …

Semantically aware web service composition through AI planning

O Hatzi, M Nikolaidou, D Vrakas… - … Journal on Artificial …, 2015 - World Scientific
Web service composition is a significant problem as the number of available web services
increases; however, manual composition is not an efficient option. Automated web service …