Filters








2,919 Hits in 3.5 sec

An SDP approach to multi-level crossing minimization

Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
2012 ACM Journal of Experimental Algorithmics  
We present an approach based on semidefinite programs (SDP) to tackle the multi-level crossing minimization problem.  ...  ., the graph's vertices are assigned to multiple parallel levels) and ask for an ordering of the nodes on their levels such that, when drawing the graph with straight lines, the resulting number of crossings  ...  Introduction Multi-level crossing minimization (MLCM) is an important task in automatic graph drawing.  ... 
doi:10.1145/2133803.2330084 fatcat:iwqizdo5mnbohkzzka4f6zjxla

An SDP Approach to Multi-level Crossing Minimization [chapter]

Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
2011 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)  
We present an approach based on semidefinite programs (SDP) to tackle the multi-level crossing minimization problem.  ...  ., the graph's vertices are assigned to multiple parallel levels) and ask for an ordering of the nodes on their levels such that, when drawing the graph with straight lines, the resulting number of crossings  ...  Introduction Multi-level crossing minimization (MLCM) is an important task in automatic graph drawing.  ... 
doi:10.1137/1.9781611972917.12 dblp:conf/alenex/ChimaniHJM11 fatcat:3n5mvfilsvfsvacb2mu6z3ps4u

Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme

Markus Chimani, Philipp Hungerländer
2013 Journal of Graph Algorithms and Applications  
In traditional multi-level graph drawing-known as Sugiyama's framework-the number of crossings is considered one of the most important goals.  ...  We present heuristic and exact approaches to tackle the verticality problem and study them in practice.  ...  multi-level drawings is minimized.  ... 
doi:10.7155/jgaa.00296 fatcat:e2zm4f7fgrd5ta3mftqyaghhdq

Exact Approaches to Multilevel Vertical Orderings

Markus Chimani, Philipp Hungerländer
2013 INFORMS journal on computing  
This Multi-Level Vertical Ordering (MLVO) problem is a quadratic ordering problem and conceptually related to the well-studied problem of Multi-Level Crossing Minimization (MLCM).  ...  Finally, we also compare our approach to related MLCM approaches.  ...  We would like to thank Petra Mutzel and Michael Jünger for introducing us to each other, to graph drawing and crossing numbers, and in particular for useful discussions on the topic of multi-level graph  ... 
doi:10.1287/ijoc.1120.0525 fatcat:qztfqr2mfve2jkg3h27sjt2kki

Semidefinite relaxations of ordering problems

P. Hungerländer, F. Rendl
2013 Mathematical programming  
Ordering problems assign weights to each ordering and ask to find an ordering of maximum weight. We consider problems where the cost function is either linear or quadratic.  ...  We present a systematic investigation of semidefinite optimization based relaxations for the quadratic ordering problem, extending and improving existing approaches.  ...  Acknowledgement: We thank Gerhard Reinelt and Marcus Oswald from Universität Heidelberg for many fruitful discussions and practical hints regarding the polyhedral approach to LOP.  ... 
doi:10.1007/s10107-012-0627-7 fatcat:ptqki3odenhmzo3ubh3eydu2ki

A Robust Transmission Strategy for Multi-Cell Interference Networks

Tuan Anh Le, Mohammad Reza Nakhai, Keivan Navaie
2014 2015 IEEE Global Communications Conference (GLOBECOM)  
This is in contrast to the standard rank-relaxed SDP technique that requires an additionally high computational complexity to approximate the solutions with sufficient accuracies, required for an effective  ...  We transform the proposed scheme to a robust optimization problem for the worst case of errors and derive a semidefinite programming (SDP) using rank-relaxation.  ...  This is due to minimizing the intercell interference of cross-links as an integral part of the cost function of a proposed optimization process that designs the beamforming vectors for sum-power minimization  ... 
doi:10.1109/glocom.2014.7417142 dblp:conf/globecom/LeNN15 fatcat:uwowoxmeafd5tixlxcah5h6hv4

A Robust Transmission Strategy for Multi-Cell Interference Networks

Tuan Anh Le, Mohammad Reza Nakhai, Keivan Navaie
2015 2015 IEEE Global Communications Conference (GLOBECOM)  
This is in contrast to the standard rank-relaxed SDP technique that requires an additionally high computational complexity to approximate the solutions with sufficient accuracies, required for an effective  ...  We transform the proposed scheme to a robust optimization problem for the worst case of errors and derive a semidefinite programming (SDP) using rank-relaxation.  ...  This is due to minimizing the intercell interference of cross-links as an integral part of the cost function of a proposed optimization process that designs the beamforming vectors for sum-power minimization  ... 
doi:10.1109/glocom.2015.7417142 fatcat:5hluklo3pzcs7jbrbaevzca5ce

An energy-efficient cooperative spectrum sensing scheme for cognitive radio networks

Nan Zhao, F. Richard Yu, Hongjian Sun, Arumugam Nallanathan
2012 2012 IEEE Global Communications Conference (GLOBECOM)  
This is in contrast to the standard rank-relaxed SDP technique that requires an additionally high computational complexity to approximate the solutions with sufficient accuracies, required for an effective  ...  We transform the proposed scheme to a robust optimization problem for the worst case of errors and derive a semidefinite programming (SDP) using rank-relaxation.  ...  This is due to minimizing the intercell interference of cross-links as an integral part of the cost function of a proposed optimization process that designs the beamforming vectors for sum-power minimization  ... 
doi:10.1109/glocom.2012.6503674 dblp:conf/globecom/ZhaoYSN12 fatcat:jtw6iovylzb3bj5hoaj3bzfzra

Transition-based Semantic Dependency Parsing with Pointer Networks [article]

Daniel Fernández-González, Carlos Gómez-Rodríguez
2020 arXiv   pre-print
In addition, we enhance our approach with deep contextualized word embeddings extracted from BERT.  ...  In order to further test the capabilities of these powerful neural networks on a harder NLP problem, we propose a transition system that, thanks to Pointer Networks, can straightforwardly produce labelled  ...  Training Objectives The Pointer Network is trained to minimize the negative log likelihood (implemented as cross-entropy loss) of producing the correct SDP graph y for a given sentence x: P θ (y|x).  ... 
arXiv:2005.13344v2 fatcat:ym73vvlclvcj3egz2amvfy722y

Deep Neural Network Based Relation Extraction: An Overview [article]

Hailin Wang, Ke Qin, Rufai Yusuf Zakari, Guoming Lu, Jin Yin
2021 arXiv   pre-print
An effective way to automatically acquire this important knowledge, called Relation Extraction (RE), a sub-task of information extraction, plays a vital role in Natural Language Processing (NLP).  ...  Knowledge is a formal way of understanding the world, providing a human-level cognition and intelligence for the next-generation artificial intelligence (AI).  ...  +max-pooling +augmentation WE2+GR+POS +WN+SDP(augmentation) Cross entropy SGD 86.1 multi-channel-rnn +max-pooling WE2+GR+POS+WN+SDP 84.16 Xiao et al. [51] BLSTM+BLSTM 2-level-BLSTM  ... 
arXiv:2101.01907v2 fatcat:o23huhxnhjfmrk4x3gvgpnbbm4

A Truck Scheduling Problem for Multi-Crossdocking System with Metaheuristics

Phan Nguyen Ky Phuc, Nguyen Van Thanh, Duong Bao Tram
2022 Computers Materials & Continua  
This study also developed an exact mathematical model using mixedinteger linear programming (MILP) with the objective of minimizing the makespan to obtaint the benchmark in small scale problems.  ...  According to the definition, cross-docking is a process dealing with transhipping inventory, in which goods and products are unloaded from an inbound truck and process through a flow-center to be directly  ...  Reference [15] first contributed to this topic with a multi cross-dock model to minimize the operational cost.  ... 
doi:10.32604/cmc.2022.027967 fatcat:4ejaitemkrgjhpcjb2rrxjbfci

A genetic type-2 fuzzy logic based approach for the optimal allocation of mobile field engineers to their working areas

Andrew Starkey, Hani Hagras, Sid Shakya, Gilbert Owusu
2015 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)  
Part of the process of optimizing the resource allocation to tasks involves finding the optimum area for an engineer to operate within, which we term as work area optimization.  ...  Nevertheless, there are many objectives that need to be satisfied and hence multi-objective based optimization will be more suitable.  ...  This helps to decide if an SDP should be added to a patch.  ... 
doi:10.1109/fuzz-ieee.2015.7337869 dblp:conf/fuzzIEEE/StarkeyHSO15 fatcat:6jl5e2he3bcbpeg7nqbkrakvfq

"Analyzing the Effect with Integrated Technique for Feature Selection and Software Defect Prediction"

2019 International journal of recent technology and engineering  
The primary aim of the primary class is to classification of the software system entities like functions, classes, files, etc into completely different levels of severity with the assistance of various  ...  The third category utilizes association rule mining approaches, for instance, relative affiliation rule [7], and also the cba2 algorithmic rule, to mine the affiliation between the errors of programming  ...  This study proposed a multi-objective optimization based supervised approach MULTI to develop Justin-time software defect prediction (JIT-SDP) models.  ... 
doi:10.35940/ijrte.b1625.078219 fatcat:uk4zb3iqsre5toghx3iim3bkla

Semantics as a Foreign Language

Gabriel Stanovsky, Ido Dagan
2018 Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing  
We propose a novel approach to semantic dependency parsing (SDP) by casting the task as an instance of multi-lingual machine translation, where each semantic representation is a different foreign dialect  ...  Beyond SDP, our linearization technique opens the door to integration of graph-based semantic representations as features in neural models for downstream applications.  ...  They reached 88% average labeled F1 score across the SDP representations on an in-domain test set, via joint prediction of the three representations using higher-order cross-representation features.  ... 
doi:10.18653/v1/d18-1263 dblp:conf/emnlp/StanovskyD18 fatcat:4blyps4sx5efxnn4tfc5o4fvz4

Neuroevolutionary reinforcement learning for generalized helicopter control

Rogier Koppejan, Shimon Whiteson
2009 Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09  
models, and that model-based approaches can outperform the simple modelfree strategy, especially if prior knowledge is used to aid model learning.  ...  Helicopter hovering is an important challenge problem in the field of reinforcement learning.  ...  ACKNOWLEDGEMENTS We would like to thank Nate Kohl and Joe Reisinger for their helpful comments on a draft of this work.  ... 
doi:10.1145/1569901.1569922 dblp:conf/gecco/KoppejanW09 fatcat:sml4esoqtveabcpba56peklf6m
« Previous Showing results 1 — 15 out of 2,919 results