Sciweavers

68 search results - page 12 / 14
» A Hybrid Exact Algorithm for the TSPTW
Sort
View
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 8 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 9 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
ISBRA
2010
Springer
14 years 2 months ago
"Master-Slave" Biological Network Alignment
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
Nicola Ferraro, Luigi Palopoli, Simona Panni, Simo...
VISUALIZATION
2000
IEEE
14 years 11 hour ago
Mastering interactive virtual Bronchioscopy on a Low-end PC
Virtual endoscopy presents the cross-sectional acquired 3D-data of a computer tomograph as an endoluminal view. The common approach for the visualization of a virtual endoscopy is...
Anna Vilanova, Balint Hegedüs, Eduard Grö...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....