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...
详细信息
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.
this two-volume book provides an insight into the 10th International conference on Soft computing for Problem Solving (SocProS 2020). this international conference is a joint technical collaboration of Soft computing ...
详细信息
ISBN:
(数字)9789811627095
ISBN:
(纸本)9789811627088
this two-volume book provides an insight into the 10th International conference on Soft computing for Problem Solving (SocProS 2020). this international conference is a joint technical collaboration of Soft computing Research Society and Indian Institute of Technology Indore. the book presents the latest achievements and innovations in the interdisciplinary areas of soft computing. It brings together the researchers, engineers and practitioners to discuss thought-provoking developments and challenges, in order to select potential future directions. It covers original research papers in the areas including but not limited to algorithms (artificial immune system, artificial neural network, genetic algorithm, genetic programming and particle swarm optimization) and applications (control systems, data mining and clustering, finance, weather forecasting, game theory, business and forecasting applications). the book will be beneficial for young as well as experienced researchers dealing across complex and intricate real-world problems for which finding a solution by traditional methods is a difficult task.
this two-volume book provides an insight into the 10th International conference on Soft computing for Problem Solving (SocProS 2020). this international conference is a joint technical collaboration of Soft computing ...
详细信息
ISBN:
(数字)9789811627125
ISBN:
(纸本)9789811627118
this two-volume book provides an insight into the 10th International conference on Soft computing for Problem Solving (SocProS 2020). this international conference is a joint technical collaboration of Soft computing Research Society and Indian Institute of Technology Indore. the book presents the latest achievements and innovations in the interdisciplinary areas of soft computing. It brings together the researchers, engineers and practitioners to discuss thought-provoking developments and challenges, in order to select potential future directions. It covers original research papers in the areas including but not limited to algorithms (artificial immune system, artificial neural network, genetic algorithm, genetic programming and particle swarm optimization) and applications (control systems, data mining and clustering, finance, weather forecasting, game theory, business and forecasting applications). the book will be beneficial for young as well as experienced researchers dealing across complex and intricate real-world problems for which finding a solution by traditional methods is a difficult task.
暂无评论