9,393 Hits in 9.2 sec

Methods and Applications [chapter]

1997 After the Event  
Abstract Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent phase to find a local minimum, and in  ...  a perturbation phase to get out of the corresponding valley.  ...  This has been done for graph theory in a long series of papers with the common title "Variable neighborhood search for extremal graphs" and reporting on development and applications of the system AutoGraphiX  ... 
doi:10.1016/b978-008043074-4/50023-5 fatcat:7clkbkmqtbgkjdpzgzpjl7ug5e

Distance Approximation in Bounded-Degree and General Sparse Graphs [chapter]

Sharon Marko, Dana Ron
2006 Lecture Notes in Computer Science  
This fraction is taken with respect to a given upper bound m on the number of edges. In particular, for graphs with degree bound d over n vertices, m = dn.  ...  Specifically, these properties are k-edge connectivity, subgraph-freeness (for constant size subgraphs), being a Eulerian graph, and cycle-freeness.  ...  The squared nodes represent the sets of the 3-bounded extreme-sets partition. Procedure 1 (Extreme-set search from a given vertex v) 1. Repeat the following process for every i = 1, . . . , r.  ... 
doi:10.1007/11830924_43 fatcat:vvkdkhnkt5berjzrjnizsgskly

Answering top-k representative queries on graph databases

Sayan Ranu, Minh Hoang, Ambuj Singh
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
To further optimize the quadratic computational cost of the greedy algorithm, we propose an index structure called NB-Index to index the θ-neighborhoods of the database graphs by employing a novel combination  ...  While graph databases model a wide range of scientific data, solving the problem in the context of graphs presents us with unique challenges due to the inherent complexity of matching structures.  ...  Acknowledgements: The work was supported by NSF grant IIS-1219254. We also thank Google for travel grant PO 55022251.  ... 
doi:10.1145/2588555.2610524 dblp:conf/sigmod/RanuHS14 fatcat:dfamf4x4mjavdcbljmbvptv7pq

INPoD: In-Network Processing over Sensor Networks based on Code Design

Kiran Misra, Shirish Karande, Hayder Radha
2007 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks  
We formulate the design of CNG, as a convex optimization problem, which determines the best codes to be used, given the underlying network connectivity and channel conditions.  ...  In this paper, we specifically address this problem, and propose the INPoD framework, which enables the use of LDPC design tools in the design of CNG for a given sensor network topology.  ...  Based on the graph connectivity we give the following bounds corresponding to the parity and data sides. where, | | f N is the size of incoming-neighborhood of f .  ... 
doi:10.1109/sahcn.2007.4292844 dblp:conf/secon/MisraKR07 fatcat:gejxfejqufaf5hex4zsptv6oxu

Tabu search and finite convergence

Fred Glover, Saı̈d Hanafi
2002 Discrete Applied Mathematics  
We establish ÿnite convergence for some tabu search algorithms based on recency memory or frequency memory, distinguishing between symmetric and asymmetric neighborhood structures.  ...  These are the ÿrst demonstrations of explicit bounds provided by such forms of memory, and their ÿniteness suggests an important distinction between these ideas and those underlying certain "probabilistic  ...  branch on (i.e., implicitly, the indexing of the variables) may be changed on forward steps.  ... 
doi:10.1016/s0166-218x(01)00263-3 fatcat:uo3ujbhu3famvhordseu5imani

Variable neighborhood search: Principles and applications

Pierre Hansen, Nenad Mladenović
2001 European Journal of Operational Research  
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and eective metaheuristic for combinatorial and global optimization, called variable neighborhood search  ...  Moreover, several extensions are proposed for solving large problem instances: using VNS within the successive approximation method yields a two-level VNS, called variable neighborhood decomposition search  ...  and Bjarne Toft for discussions of AGX and David Schilling for providing test problems for the PM problem.  ... 
doi:10.1016/s0377-2217(00)00100-4 fatcat:xwip6dbspvbmbmmwjeghfipx7u

The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search [article]

Bjoern Andres and Joerg H. Kappes and Ullrich Koethe and Fred A. Hamprecht
2010 arXiv   pre-print
This article presents a new search algorithm for the NP-hard problem of optimizing functions of binary variables that decompose according to a graphical model.  ...  For a search depth of 1, it specializes to Iterated Conditional Modes. Between these extremes, a useful tradeoff between approximation quality and runtime is established.  ...  Acknowledgments Acknowledgement pending approval by the acknowledged individuals.  ... 
arXiv:1009.4102v1 fatcat:f4ugnggwdncv3jm6lsb6ehvsnq

Read networks and k-laminar graphs [article]

Finn Völkel and Eric bapteste and Michel Habib and Philippe Lopez and Chloe Vigliotti
2016 arXiv   pre-print
For the recognition of k-laminar graphs, we develop polynomial algorithms when k is fixed. For k=1, our algorithm improves a Deogun and Krastch's algorithm (1999).  ...  We briefly develop the context of the biological application in which this graph class appeared and then we consider the relationships of this new graph class among known graph classes and then we study  ...  Acknowledgements: The authors wish to thank Anthony Herrel for many discussions on the project and for having selected the lizards on which this study is based.  ... 
arXiv:1603.01179v1 fatcat:ngyvsunv3jevppfandkttfajka

Scalable discovery of best clusters on large graphs

Kathy Macropol, Ambuj Singh
2010 Proceedings of the VLDB Endowment  
In this paper we propose a new technique, Top Graph Clusters (TopGC), which probabilistically searches large, edge weighted, directed graphs for their best clusters in linear time.  ...  The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection.  ...  The value of mhi for a vertex vj is the element in its neighborhood Nj with the lowest ordering index in πi.  ... 
doi:10.14778/1920841.1920930 fatcat:dcdg7tdpyfbzrms4c5tqauyfoy

Efficient lookup on unstructured topologies

Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh
2005 Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '05  
We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations, we show that the actual performance on realistic topologies is significantly better.  ...  It is vastly more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a DHT.  ...  The asymptotic bound is O(n 1/(2+h) ) for h hop neighborhoods.  ... 
doi:10.1145/1073814.1073828 dblp:conf/podc/MorselliBSM05 fatcat:676qfjyuwbfblkgg3r6mzrhhua

Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search

Francisco Chicano, Darrell Whitley, Gabriela Ochoa, Renato Tinós
2017 Proceedings of the Genetic and Evolutionary Computation Conference on - GECCO '17  
In gray-box optimization, the search algorithms have access to the variable interaction graph (VIG) of the optimization problem.  ...  For Mk Landscapes (and NK Landscapes) we can use the VIG to identify an improving solution in the Hamming neighborhood in constant time.  ...  We can search for connected components of the recombination graph to identify the recombining components. e decomposition shown in Figure 2 results in q = 3 recombining components.  ... 
doi:10.1145/3071178.3071285 dblp:conf/gecco/ChicanoWOT17 fatcat:rmtfng2nzjb4napg6aiymi32ki

Efficient lookup on unstructured topologies

R. Morselli, B. Bhattacharjee, M.A. Marsh, A. Srinivasan
2007 IEEE Journal on Selected Areas in Communications  
We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations, we show that the actual performance on realistic topologies is significantly better.  ...  It is vastly more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a DHT.  ...  The asymptotic bound is O(n 1/(2+h) ) for h hop neighborhoods.  ... 
doi:10.1109/jsac.2007.07007 fatcat:a2mljzecl5cljgxh7dwg3gzz6m

Problems of discrete optimization: Challenges and main approaches to solve them

I. V. Sergienko, V. P. Shylo
2006 Cybernetics and Systems Analysis  
For this problem, a technique of estimating the potency of independent sets using the specificity of graphs is proposed.  ...  In this connection, development and study of various approximate methods for solving such problems are important.  ...  Different modifications of the variable neighborhood search were also successfully used to solve median problems [76] and finding an extremal graph [54] .  ... 
doi:10.1007/s10559-006-0086-3 fatcat:eabgekxv25hs7ka63prruyiioy

A Theoretical Analysis of the k-Satisfiability Search Space [chapter]

Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
2009 Lecture Notes in Computer Science  
We use this result to prove previously unknown bounds for local maxima and plateau width in the 3-SAT search space.  ...  In this paper we study the search space of the k-SAT problem and show that it can be analyzed by a decomposition.  ...  This research was sponsored by the Air Force Office of Scientific Research, Air Force Materiel Command, USAF, under grant number FA9550-08-1-0422. The U.S.  ... 
doi:10.1007/978-3-642-03751-1_4 fatcat:aygisbaopzfufmh76kd4hnxqmm

Probing a Set of Trajectories to Maximize Captured Information [article]

Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips
2020 arXiv   pre-print
We study the integrality gap arising from such approaches. We analyze our methods on different classes of data, including benchmark instances that we generate.  ...  We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set T of trajectories in the plane, and an integer k≥ 2, we seek to compute a set of k points  ...  ., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA-0003525.  ... 
arXiv:2004.03486v1 fatcat:dsnexg6vhjeidhdgau24vwqn6e
« Previous Showing results 1 — 15 out of 9,393 results