this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
标签： Traveling Salesman solution Problem
上传时间： 2013-12-21
上传用户：ruixue198909
Visual Basic 6.0可以通过调用API函数格式化一个磁盘，无论是软盘还是硬盘。 打开一个新的项目(工程1) ，如果你没有更改过缺省模式，那么Visual Basic 6.0会自动添加一个form1文件，在form1上添加一个命令控件，将下面的代码拷入。 Option Explicit Private Declare Function SHFormatDrive Lib"shell32"( ByVal Hend AS Long,ByVal Drive AS Long,ByVal FormatID AS Long,ByVal Options AS Long) as Long Private Sub FormatDisk(intDrive as integer,blnQuickFormat as Boolean) dim lngReturn As Long if (blnQuickFormat) then lngReturn= SHFormatDrive(0,intDrive,0&,1&) else lngReturn= SHFormatDrive(0,intDrive,0&,0&) end if end Sub Private Sub Command1_Click() call FormatDisk(0,True) End Sub 运行此程序。 注意FormatDisk函数的第一个变量很重要，他的值是0,1,2时代表格式化的分别是：A、B、C盘。
上传时间： 2015-10-05
上传用户：kytqcool
With the release of PHP 5 web developers need a guide to developing with PHP 5 to both learn its complex new features and more fully implement the long-standing features on which PHP s success is built. PHP 5 in Practice is a reference guide that provides developers with easy-to-use and easily extensible code to solve common PHP problems. It focuses on providing real code solutions to problems, allowing the reader to learn by seeing exactly what is happening behind the scenes to get your solution. Because a real-life situation will rarely match the book s example problems precisely, PHP 5 in Practice explains the solution well enough that you will understand it and can learn how to truly solve your own problem.
标签： developers developing PHP release
上传时间： 2013-12-17
上传用户：xzt
This paper presents several low-latency mixed-timing FIFO (first-in–first-out) interfaces designs that interface systems on a chip working at different speeds. The connected systems can be either synchronous or asynchronous. The designs are then adapted to work between systems with very long interconnect delays, by migrating a single-clock solution by Carloni et al. (1999, 2000, and 2001) (for “latency-insensitive” protocols) to mixed-timing domains. The new designs can be made arbitrarily robust with regard to metastability and interface operating speeds. Initial simulations for both latency and throughput are promising.
标签： mixed-timing low-latency interfaces first-out
上传时间： 2015-10-08
上传用户：dapangxie
％CHECKBOUNDS Move the initial point within the (valid) bounds. ％ [X,LB,UB,X,FLAG] = CHECKBOUNDS(X0,LB,UB,nvars) ％ checks that the upper and lower ％ bounds are valid (LB <= UB) and the same length as X (pad with -inf/inf ％ if necessary) warn if too long. Also make LB and UB vectors if not ％ already. ％ Finally, inf in LB or -inf in UB throws an error.
标签： CHECKBOUNDS the initial bounds
上传时间： 2015-10-26
上传用户：caiiicc
This an excellent collection of XML best practices: essential reading for any developer using XML. This book will help you avoid common pitfalls and ensure your XML applications remain practical and interoperable for as long as possible." Edd Dumbill, Managing Editor, XML.com and Program Chair, XML Europe
标签： collection XML excellent essential
上传时间： 2014-01-18
上传用户：海陆空653
问题描述：编写一个JAVA程序，用面向对象设计的方法编写一个电话卡的类。包括卡号、密码、余额、拨入号码等 b）基本要求：类的属性有卡号、密码、余额、拨入号码，电话卡的常用操作可以用连接电话方法、返回余额方法与通电话方法来实现。 c）方法功能描述： 构造方法（PhoneCard(卡号,密码,余额,拨入号码)）可以完成属性值初始化赋值，并判断余额，余额为负就退出系统，请在构造方法中将初始时的连接置为false即表示没有连接。 卡号long cardNumber 密码private int password,余额double balance,拨入号码string connectNumber boolean connected(一个布尔类型变量表示电话卡连接状态，初始时默认没有连接，值为false，当调用连接电话方法()后，在判断卡号和密码相匹配后值置为true) 连接电话方法(performConnection(卡号,密码))可以完成检查卡号和密码，它是只有在卡号和密码相匹配时才连接 返回余额方法(getBalance())得到电话卡的余额 通电话方法(performDial())是模拟通过过程中，余额会不断减少，每调用此方法，电话卡的余额减少0。5元,打一次电话调用一次
上传时间： 2014-01-20
上传用户：1109003457
The Game: Make the snake grow longer by directing it to the food. Extra bonus points are given from hearts, eat them as fast as possible as amount of bonus points decreases with time. Higher level gives more points for the food but will also make it tougher to steer a long snake as speed increaces. Five different mazes as well as play w/o maze are possible.
标签： the directing longer points
上传时间： 2013-12-19
上传用户：璇珠官人
编码方式的解码示范uuencode and uudecode are in the public domain. dos2unix and unix2dos are hereby placed in the public domain. They may be shared or copied as long as NO fee is charged for their distribution or use.
上传时间： 2015-11-16
上传用户：hfmm633
The ability to write efficient, high-speed arithmetic routines ultimately depends upon your knowledge of the elements of arithmetic as they exist on a computer. That conclusion and this book are the result of a long and frustrating search for information on writing arithmetic routines for real-time embedded systems. With instruction cycle times coming down and clock rates going up, it would seem that speed is not a problem in writing fast routines. In addition, math coprocessors are becoming more popular and less expensive than ever before and are readily available. These factors make arithmetic easier and faster to use and implement. However, for many of you the systems that you are working on do not include the latest chips or the faster processors. Some of the most widely used microcontrollers used today are not Digital Signal Processors (DSP), but simple eight-bit controllers such as the Intel 8051 or 8048 microprocessors.
标签： arithmetic high-speed ultimately efficient
上传时间： 2014-11-30
上传用户：lizhen9880
