The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Distributed coordination and control strategies based on modified version of the cellular automata ant (CAA) system directs mobile robots for accomplishing foraging cooperative tasks. A foraging task is divided into two main parts, called here, searching and homing. From previous applications of the foraging strategy, it was possible to confirm that the general and complex team behavior emerges from...
The problem of creation of quasi-orthogonal signals ensembles with a large number of isomorphic transformations to improve the structural secrecy of asynchronous address radio systems is considered. The chosen subclass of the code sequences ensembles is characterized by a set of options of isomorphic sets creation, the search and enumeration of which is a nontrivial computational problem. Justification...
The capacitated min-k-cut problem of hypergraphis the problem of partitioning the vertices into k parts, and each part has a different capacity. The objective is to minimize the weight of cut hyper edges. It is an NP-hard problem which is an important problem with extensive applications to many areas, such as VLSI CAD, image segmentation, etc. Although many heuristic algorithms have been developed,...
Spanning subgraph is necessary for the communication in networks. For example, the malfunctioning of one or more nodes in a network in general affects both the global and the local properties of the remaining nodes, because it makes some edges unusable and destroys the connectivity of the system. In this study, we focus on the characters of a network to be fractional-r-factors, fractional (r, k)-extendable...
We describe an approach to parallel graph partitioning that scales to hundreds of processors and produces a high solution quality. For example, for many instances from Walshaw's benchmark collection we improve the best known partitioning. We use the well known framework of multi-level graph partitioning. All components are implemented by scalable parallel algorithms. Quality improvements compared...
Designing appropriate graphs is a problem frequently occurring in several common applications ranging from designing communication and transportation networks to discovering new drugs. More often than not the graphs to be designed need to satisfy multiple, sometimes conflicting, objectives e.g. total length, cost, complexity or other shape and property limitations. In this paper we present our approach...
Vertex cover is one of the best known NP-hard combinatorial optimization problems. Experimental work has claimed that evolutionary algorithms (EAs) perform fairly well for the problem and can compete with problem-specific ones. A theoretical analysis that explains these empirical results is presented concerning the random local search algorithm and the (1+1)-EA. Since it is not expected that an algorithm...
Finding an efficient route is difficult problem for many drivers. Car Navigation Systems are sometimes offered as a special feature on new cars. These systems are capable of performing some of the tasks traditionally performed by driver, such as determining the best route to the destination. This process of finding shortest path from one point to another, is called routing. In this paper, a new shortest...
Motivated toward dynamic rolling control of hybrid walking-climbing-rolling robots, this paper presents a greedy graph search method using two different metrics for purposes of joint path planning for a planar three degree of freedom hybrid mobility robot. Given an initial configuration and a desired net center of gravity location for the robot, the graph search finds joint paths that relocate the...
We present a variable neighborhood search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two different neighborhood structures we show that a carefully designed combination of a metaheuristic and an exact method based on integer linear programming is able to improve solution quality compared to using heuristic methods...
Although one of the most common usages of Internet is searching, especially in image search, the users are not satisfied due to many irrelevant results. In this paper we present a method to identify irrelevant results of image search on the Internet and re-rank the results so that the relevant results will have a higher priority within the list. The proposed method represents the similarity of images...
In parallel computation two approaches are common; namely unbounded parallelism and bounded parallelism. In this paper both approaches will be considered. The problem of unbounded parallelism is studied in section II and some lower and upper bounds on different connectivity problems for directed and undirected graphs are presented. In section III we mention bounded parallelism and three different...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.