Search - optimal location

Search - optimal location - List

[Windows Develop] 3_2 DL : 0: 这是个五子棋人机对战部分的代码，有完整的界面初始化部分，用搜索算法实现了电脑对最优位置的选取，实现电脑下棋的功能。-This is a 331 man-machine players part of the code, a complete initialization interface, search algorithm using a computer to select the optimal location to achieve the function of the computer playing chess.
Date : 2008-10-13 Size : 74.81kb User : 唐宇
[Windows Develop] 3_2 DL : 0: 这是个五子棋人机对战部分的代码，有完整的界面初始化部分，用搜索算法实现了电脑对最优位置的选取，实现电脑下棋的功能。-This is a 331 man-machine players part of the code, a complete initialization interface, search algorithm using a computer to select the optimal location to achieve the function of the computer playing chess.
Date : 2025-12-24 Size : 3.77mb User : 唐宇
[Windows Develop] pipe DL : 0: 某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n口油井的位置,即它们的x 坐标（东西向）和y 坐标（南北向）,应如何确定主管道的最优位置, 即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置。 « 编程任务：给定n 口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。-An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time to determine the optimal position in charge of Road. 芦Programming mission: to set the location of oil wells n, programmed to calculate the well-to-charge of Road between the length of the sum of the smallest oil pipeline.
Date : 2025-12-24 Size : 1kb User : chenxueping
[Windows Develop] oil_tube DL : 0: 某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n口油井的油田。从每口油井都要有一条输油管道沿最短路径(或南或北)与主管道相连。如果给定n口油井的位置，即它们的x坐标(东西向)和y坐标(南北向)，应该如何确定主管道的最优位置，即使个油井到主管道之间的输油管道长度总和最小的位置？ (2) 算法设计给定n口油井的位置，计算个油井到主管道之间的输油管道最小长度总和。 (3) 数据输入由文件提供数据。文件的第一行为油井数n，1<=n<=10000；接下来n行是油井的位置，每行2个整数x和y，-10000<=x,y<=10000。-An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) Road, connected with the director. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), director Road should be how to determine the optimal location, even if the wells to the Road, director of the oil pipeline between the length of the sum of the smallest location? (2) Algorithm Design N given the location of oil wells, oil wells to calculate Road director of the oil pipeline between the sum of minimum length. (3) data entry Provide data from the document. Documents the first acts of a few oil wells n, 1 <= n <= 10000 next n lines are the location of wells, each row two integers x and y,-10000 <= x, y <= 10000.
Date : 2025-12-24 Size : 1kb User : chenhui
[Windows Develop] 2 DL : 0: 问题描述：某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n口油井的位置,即它们的x 坐标（东西向）和y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置? 编程任务：给定n 口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。 -Problem Description: A plan to build a oil from east to west of the main pipeline. The pipeline to pass through a field of n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the director of Road. If given the location of oil wells n, that is, their x coordinates (east-west) and y coordinates (north-south), head of Road should be how to determine the optimal position, even if the well-to-head Road, the pipeline length between the sum of the smallest location? programming tasks: to set the location of oil wells n, programming the calculation of the well-to-head Road, the pipeline between the sum of the minimum length.
Date : 2025-12-24 Size : 1kb User : yuecuiping
[Windows Develop] disk DL : 0: 贪心算法作业的解题报告(含证明)和源代码:磁盘文件最优存储问题，当初证明花了一些时间。问题描述：设磁盘上有n个文件，f1,f2,…,fn，，每个文件占磁盘上1个磁道。这n个文件的检索概率分别是p1,p2,…,pn, 且∑pi=1。磁头从当前磁道移到被检信息磁道所需的时间可用这2 个磁道之间的径向距离来度量。如果文件pi存放在第i道上, ，则检索这n 个文件的期望时间是∑pipjd(i,j) 其中d(i,j) 是第i道与第j 道之间的径向距离|i-j|。磁盘文件的最优存储问题要求确定这n个文件在磁盘上的存储位置，使期望检索时间达到最小。试设计一个解此问题的算法，并分析算法的正确性和计算复杂性。-Greedy algorithm for solving the report of operations (including certificate) and the source code: the optimal disk file storage issues, had spent some time to prove. Problem Description: There are n disk-based files, f1, f2, ..., fn,, accounts for each file on a disk track. This n the probability of a document retrieval are p1, p2, ..., pn, And Σpi = 1. Head from the current track information to be seized can be used track the time required between these two tracks to measure the radial distance. Pi if the file stored in the first track i,, then retrieve documents that the expectations of n is Σpipjd (i, j) Which d (i, j) is the first i Road with the first j of the radial distance between the Road | ij |. Optimal storage disk file to seek to establish that n files on the disk storage location, so expect to minimize search time. Try to design a solution algorithm for this problem and to analyze the correctness of algorithms and computational complexity.
Date : 2025-12-24 Size : 260kb User : 吴钦阳
[Windows Develop] chaoshixuanzhi DL : 0: 超市选址系统，根据给出的各单位之间距离及其要去超市的频率来选择超市的位置，实现总体最优-Supermarket site, according to the distance between the units given its going to the frequency of the supermarket supermarkets to choose the location, to achieve the overall optimal
Date : 2025-12-24 Size : 5kb User : vivid
[Windows Develop] ms_segmenter DL : 0: Image segmentation We propose a segmentation framework that takes as its input a xation (a point location) in the scene and outputs the region containing that xation. The xated region is segmented in terms of the area enclosed by the \optimal" closed boundary around the xation using the probabilistic boundary edge map of the scene (or image). The probabilistic boundary edge map, which is generated by using all available visual cues, contains the probability of an edge pixel being at an object (or depth) boundary
Date : 2025-12-24 Size : 47kb User : robin