In this paper, we study two lemma methods for accelerating Loveland's model elimination calculus: One is lemma generalization and another is non-unit lemma matching. the derivation of lemmas in this paper is a dyn...
详细信息
Ant Colony Optimization (ACO) is a paradigm that em- ploys a set of cooperating agents to solve functions or obtain good so- lutions for combinatorial optimization problems. It has previously been applied to the TSP a...
详细信息
Pure functional programming languages have been proposed as a vehicle to describe, simulate and manipulate circuit specifications. We propose an extension to Haskell to solve a standard problem when manipulating data ...
详细信息
In PCS (personal communication systems) networks, location management deals withthe problem of tracking down a mobile user. It involves two kinds of activ- ities: one is location updating and the other is paging [1]....
ISBN:
(纸本)354066856X
In PCS (personal communication systems) networks, location management deals withthe problem of tracking down a mobile user. It involves two kinds of activ- ities: one is location updating and the other is paging [1]. Each cost for location updating and paging is significantly associated with each other and therefore, has a trade-off relationship to total signaling cost. Location management strategies, as implemented in current PCS networks and as presented in this literature, are based on spatially static location areas that are built by heuristics or aggregate statistics [1,2]. the static location areas are used identically for all mobile users, even though the mobility pattern and call arrival rate of each mobile user are diffierent spatially and temporally. thus, the location management applied to same location areas for all mobile users suffers from the various mobile proper- ties of users. Consequently, these strategies can not efficiently reduce the total signaling cost.
Current standards of ATM can only support pt-pt (or unicast) connections and unidirectional point-to-multipoint (pt-mpt) connection and do not provide a scalable solution for truly multipoint-to-multipoint (mpt-mpt) c...
详细信息
the proceedings contain 6 papers. the special focus in this conference is on asian Supercomputing. the topics include: A crystal/clear pipeline for applied image processing;a cache-based data movement infrastructure f...
ISBN:
(纸本)9783030186449
the proceedings contain 6 papers. the special focus in this conference is on asian Supercomputing. the topics include: A crystal/clear pipeline for applied image processing;a cache-based data movement infrastructure for on-demand scientific cloud computing;PHINEAS: An embedded heterogeneous parallel platform;MH-QEMU: Memory-state-aware fault injection platform.
the paper describes the use of cloud computing in logistics, especially the creation of the multi-modal platform designed for cooperating logistics service providers and their customers. the research conducted within ...
详细信息
ISBN:
(纸本)9783642365430
the paper describes the use of cloud computing in logistics, especially the creation of the multi-modal platform designed for cooperating logistics service providers and their customers. the research conducted within the EU project is presented. the article focuses primarily on the findings of its initial phase - the analysis of information requirements needed for cloud computing platform. the processes maps and use case are proposed.
this book gathers outstanding research papers presented at the 5th International Joint conference on advances in Computational Intelligence (IJCACI 2021), held online during October 23–24, 2021. IJCACI 2021 is ...
详细信息
ISBN:
(数字)9789811903328
ISBN:
(纸本)9789811903311;9789811903342
this book gathers outstanding research papers presented at the 5th International Joint conference on advances in Computational Intelligence (IJCACI 2021), held online during October 23–24, 2021. IJCACI 2021 is jointly organized by Jahangirnagar University (JU), Bangladesh, and Southasian University (SAU), India. the book presents the novel contributions in areas of computational intelligence and it serves as a reference material for advance research. the topics covered are collective intelligence, soft computing, optimization, cloud computing, machine learning, intelligent software, robotics, data science, data security, big data analytics, and signal and natural language processing.
A system of linear constraints is represented as a set of half-planes S = {(a j X + b j Y + c j ≤ 0) j = 1...N}. therefore, in the context of linear constraints two terms “set” and &#...
ISBN:
(纸本)354066856X
A system of linear constraints is represented as a set of half-planes S = {(a j X + b j Y + c j ≤ 0) j = 1...N}. therefore, in the context of linear constraints two terms “set” and “system” can be used interchangeably whenever one of two is suitable. A set of linear constraints represents a convex polygon that is the intersection of all half-planes in the set. the convex polygon represented by S is called the feasible polygon of S. Such sets of linear constraints can be used as a new way of represent spatial data. these sets need to be manipulated efficiently and stored using minimal storage. It is natural to store only sets of linear constraints which are feasible and in irredundant format. therefore, it is very important to find out if a given system is feasible and/or bounded and to find the minimal (irredundant) set of linear constraint which have the same feasible area withthe given one. LASSEZ and MAHER (1988) have investigated algorithms to check if a system of linear constraints over multidimensional R d is feasible. LASSEZ et al (1989) have investigated algorithms to eliminate redundant constraints from a system of linear constraints over R d . their algorithms are based on the Fourier variable elimination (similar with Gaussian elimination in solving the linear system of equations) and therefore have the running time O(N 2) where N is the number of constraints, and as such it is not efficient. DYER (1984) and MEGIDDO (1983) have independent proposed linear time algorithms to solve the linear programming problem in 2- and 3-dimension cases.
暂无评论