Search - 2 opt - CodeBus

Search - 2 opt - List

[Software Engineering] xynews DL : 0: 1.增加了近40项后台核心设置，这些设置可以使大家可以很容易控制前台的显示，能按照自己的意愿调整各项参数。 2.将广告单独分开，可以由用户自由设置多项广告。并且可以通过修改模板使广告在适合的地方显示。 3.增加站点公告。 4.增加文章来源，专题，标题颜色设置等等。并且在HTML在线编辑器里增加即时图片上传，方便多图片管理。 5.文章投稿及评论都不再使用文本数据存储，这样可以更方便管理，以及审核等控制。 6.增加投票功能。-1. An increase of nearly 40 core background settings, these settings can make everyone can easily control the future, in accordance with their own will adjust various parameters. 2. Advertising alone will separate the user can set up a number of free advertising. And can change the templates so that the advertisements for the show. 3. Increase site notice. 4. Add article sources, thematic, heading color settings. In HTML editor online world has increased immediately upload pictures, photos and more convenient management. 5. Article submissions and comments are no longer in use text data storage, so can be more convenient management and control audits. 6. Increased voting.
Date : 2025-12-26 Size : 294kb User : 张帅
[Software Engineering] weijiyuanlibaogao DL : 0: 编程使小键盘的数字键1，2，3，4，5，6，7作为电子琴按键，输入对应的七个音阶，通过实验箱的喇叭发出声音，并通过七段数码管显示输入音阶；若小键盘输入“R”则返回DOS，结束程序。-Programming small keyboard's numeric keypad ,36.2 as flower button. 7 corresponding to the input scale, experimental box speakers to make their voices heard, and through digital paragraph 107 of show that the scale; If small keyboard input "R" to return to DOS, closing procedures.
Date : 2025-12-26 Size : 33kb User : 梁良
[Software Engineering] Page-replacement-algorithm DL : 0: 1）先进先出页面置换算法（FIFO） 2）最近最久未使用页面置换算法（LRU） 3）最佳置换页面置换算法（OPT）-1) FIFO page replacement algorithm (FIFO) 2) lack of use the most recent page replacement algorithm (LRU) 3) replacement of the best page replacement algorithm (OPT)
Date : 2025-12-26 Size : 20kb User : xiaoxiao
[Software Engineering] LED_demo DL : 0: My initial attempt of porting the FreeRTOS Demo was considerably a success. But later on, I found out that the version used of STM32 standard peripheral library was already obsolete. And so I didn t anymore continue with that. In stead, I opt to use the latest Firmware version which is v3.2.0 (Mar-2010), and combine it with the latest FreeRTOS source code - v6.0.4.
Date : 2025-12-26 Size : 1.76mb User : Vo Thanh Trieu
[Software Engineering] Heuristic-method-for-the-Traveling-Salesman-Probl DL : 0: Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers-Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers
Date : 2025-12-26 Size : 2kb User : ahmed
[Software Engineering] HM-TSP DL : 0: Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers-Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers
Date : 2025-12-26 Size : 2kb User : ahmed