Chocolat/SMV is a translator that takes a CafeOBJ specification of a transition system called an OTS and generates an SMV specification of a finite version of the OTS. The prim...
Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously intro...
Nguyen The Loc, Said Elnaffar, Takuya Katayama, Tu...
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
Hannes Schabauer, Erich Schikuta, Thomas Weish&aum...
A novel strategy for employing schedules obtained using standard static scheduling algorithms in a battery powered multiprocessor environment is investigated. The strategy is able...
Recent advances in wireless technology and availability of portable devices with networking capabilities made the increasing hot topic, ubiquitous computing become reality. Also, ...
Large-Scale network such as the Internet consist of a large number of sub-networks. Since each subnetwork has management privileges and policies individually, it is difficult to r...
Kanghee Lee, Zhefan Jiang, Sangok Kim, Sangwook Ki...
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
In this paper, we propose a security management middleware in ubiquitous computing environments. This security management should be applicationoriented security and provides user-...
Zhefan Jiang, Kanghee Lee, Sangok Kim, Hyunchul Ba...
This paper presents a performance study of a nonrigid registration algorithm for investigating lung disease on clusters. Our algorithm combines two conventional acceleration techn...