A searcher faces a graph with edge lengths and vertex weights, initially having explored only a given starting vertex. In each step, the searcher adds an edge to the solution that connects an unexplored vertex to an e...
详细信息
Decision-making in medical diagnosis is often hampered by uncertainties due to incomplete, ambiguous, and evolving information. In reviewing the traditional methods for lung cancer detection, we found that crisp and l...
详细信息
A collaborative real-time text editor is an application that allows multiple users to edit a document simultaneously and merge their contributions automatically. It can be made collaborative by implementing a conflict...
详细信息
In the paper, we propose a mathematical model of virtual machines lifecycle in a cloud node as a queueing system with two types of customers and two phases of service with a service rate degradation. The number of ser...
详细信息
We summarize the first Workshop on the Design of Responsible Hybrid Intelligence (RHI2023), co-located with the 2st International Conference on Hybrid Human-Artificial Intelligence (HHAI 2022), held on June 27, 2022 i...
详细信息
Alon and Krivelevich proved that for every n-vertex subcubic graph H and every integer q≥2 there exists a (smallest) integer f=f(H,q) such that every Kf-minor contains a subdivision of H in which the length of every ...
A B-tree is a type of search tree where every node (except possibly for the root) contains between m and 2m keys for some positive integer m, and all leaves have the same distance to the root. We study sequences of B-...
详细信息
Wireless sensor networks(WSNs)are projected to have a wide range of applications in the *** fundamental problem with WSN is that it has afinite *** a network is a common strategy for increasing the life-time of WSNs an...
详细信息
Wireless sensor networks(WSNs)are projected to have a wide range of applications in the *** fundamental problem with WSN is that it has afinite *** a network is a common strategy for increasing the life-time of WSNs and,as a result,allowing for faster data *** cluster-ing algorithm’s goal is to select the best cluster head(CH).In the existing system,Hybrid grey wolf sunflower optimization algorithm(HGWSFO)and optimal clus-ter head selection method is *** does not provide better competence and out-put in the ***,the proposed Hybrid Grey Wolf Ant Colony Optimisation(HGWACO)algorithm is used for reducing the energy utilization and enhances the lifespan of the *** hole method is used for selecting the cluster heads(CHs).The ant colony optimization(ACO)technique is used tofind the route among origin CH and *** open cache of nodes,trans-mission power,and proximity are used to improve the CH *** grey wolf optimisation(GWO)technique is the most recent and well-known optimiser module which deals with grey wolves’hunting activity(GWs).These GWs have the ability to track down and encircle *** GWO method was inspired by this hunting *** proposed HGWACO improves the duration of the net-work,minimizes the power consumption,also it works with the large-scale *** HGWACO method achieves 25.64%of residual energy,25.64%of alive nodes,40.65%of dead nodes also it enhances the lifetime of the network.
In order to further increase efficiency while reducing harmful emissions, clever control methods have been proposed, e.g. using external electric and magnetic fields. We consider that minimalistic mathematical models ...
详细信息
Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect more than two vertices. They have a similarly wide range of applications as graphs. This article considers the fundamental and i...
详细信息
Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect more than two vertices. They have a similarly wide range of applications as graphs. This article considers the fundamental and intensively studied problem of balanced hypergraph partitioning (BHP), which asks for partitioning the vertices into k disjoint blocks of bounded size while minimizing an objective function over the hyperedges. Here, we consider the two most commonly used objectives: the cut-net metric and the connectivity *** describe our open-source hypergraph partitioner KaHyPar which is based on the successful multi-level approach - driving it to the extreme of using one level for (almost) every vertex. Using carefully designed data structures and dynamic update techniques, this approach turns out to have a very good time-quality tradeoff. We present two preprocessing techniques - pin sparsification using locality-sensitive hashing (LSH) and community detection based on the Louvain algorithm. The community structure is used to guide the coarsening process that incrementally contracts vertices. Portfolio-based partitioning of the contracted hypergraph then already achieves a good initial solution. While reversing the contraction process, a combination of several refinement techniques achieves a good final partitioning. In particular, we support a highly-localized local search that can directly produce a k-way partitioning and complement this with flow-based techniques that take a more global view. Optionally, a memetic algorithm evolves a pool of solution candidates to an overall good *** evaluate KaHyPar for a large set of instances from a wide range of application domains. With respect to quality, KaHyPar outperforms all previously considered systems that can handle large hypergraphs such as hMETIS, PaToH, Mondriaan, or Zoltan. Somewhat surprisingly, to some extend, this even extends to graph partitioners such as KaHIP when considering the special case
暂无评论