Titlebook: Experimental and Efficient Algorithms; 4th International Wo Sotiris E. Nikoletseas Conference proceedings 2005 Springer-Verlag Berlin Heide

使入伍

书目名称Experimental and Efficient Algorithms影响因子(影响力)




书目名称Experimental and Efficient Algorithms影响因子(影响力)学科排名




书目名称Experimental and Efficient Algorithms网络公开度




书目名称Experimental and Efficient Algorithms网络公开度学科排名




书目名称Experimental and Efficient Algorithms被引频次




书目名称Experimental and Efficient Algorithms被引频次学科排名




书目名称Experimental and Efficient Algorithms年度引用




书目名称Experimental and Efficient Algorithms年度引用学科排名




书目名称Experimental and Efficient Algorithms读者反馈




书目名称Experimental and Efficient Algorithms读者反馈学科排名

muffler

Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization to significantly improve the performance of memoryless construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genet

皱痕

仔细阅读

Rectangle Covers Revisited Computationallypose an integer program which is the first general approach to obtain provably optimal solutions to this well-studied .-hard problem. It applies to common variants like covering only the corners or the boundary of the polygon, and also to the weighted case. In experiments it turns out that the linea

Hemiparesis

Cleave

Cleave

Ossification

aptitude

Acceleration of Shortest Path and Constrained Shortest Path Computationd railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for shortest path computations and two methods based on a g

疯狂