虫虫首页|资源下载|资源专辑|精品软件
登录|注册

numbered

  • Genetic Algorithm example using Java You have 10 cards numbered 1 to 10. You have to divide them i

    Genetic Algorithm example using Java You have 10 cards numbered 1 to 10. You have to divide them into 2 piles so that: The sum of the first pile is as close as possible to 36 and the product of all in second pile is as close as poss to 360.

    标签: have Algorithm You numbered

    上传时间: 2017-03-07

    上传用户:lacsx

  • MPC7400 Part Number Speci&THOR

    MPC7400 Part Number SpeciÞcationThis document describes part number speciÞc changes to recommended operating conditions and revised electrical speciÞcations,as applicable, from those described in the generalMPC7400 Hardware SpeciÞcations.SpeciÞcations provided in this Part Number SpeciÞcation supersede those in theMPC7400 Hardware SpeciÞcationsdated 9/99(order #: MPC7400EC/D) for these part numbers only; speciÞcations not addressed herein are unchanged. This document isfrequently updated, refer to the website at http://www.mot.com/SPS/PowerPC/ for the latest version.Note that headings and table numbers in this data sheet are not consecutively numbered. They are intended to correspond to theheading or table affected in the general hardware speciÞcation.

    标签: Number Speci 7400 Part

    上传时间: 2014-12-27

    上传用户:huyahui

  • MPC7400l零件号码规范说明

    This document describes part number speciÞc changes to recommended operating conditions and revised electrical speciÞcations,as applicable, from those described in the generalMPC7400 Hardware SpeciÞcations.SpeciÞcations provided in this Part Number SpeciÞcation supersede those in theMPC7400 Hardware SpeciÞcationsdated 9/99(order #: MPC7400EC/D) for these part numbers only; speciÞcations not addressed herein are unchanged. This document isfrequently updated, refer to the website at http://www.mot.com/SPS/PowerPC/ for the latest version.Note that headings and table numbers in this data sheet are not consecutively numbered. They are intended to correspond to theheading or table affected in the general hardware speciÞcation.Part numbers addressed in this document are listed in Table A. For more detailed ordering information see Table B.

    标签: 7400l 7400 MPC 零件

    上传时间: 2013-11-18

    上传用户:qiaoyue

  • An instrument other than a watch for measuring or indicating time, especially a mechanical or electr

    An instrument other than a watch for measuring or indicating time, especially a mechanical or electronic device having a numbered dial and moving hands or a digital display.break down the enemy s resistance

    标签: instrument especially indicating mechanical

    上传时间: 2014-01-11

    上传用户:二驱蚊器

  • Fortran 90 versions of all the Numerical Recipes routines appear in the following Chapters B1 throu

    Fortran 90 versions of all the Numerical Recipes routines appear in the following Chapters B1 through B20, numbered in correspondence with Chapters 1 through 20 in Volume 1. Within each chapter, the routines appear in the same order as in Volume 1, but not broken out separately by section number within Volume 1鈥檚 chapters. There are commentaries accompanying many of the routines, generally following the printed listing of the routine to which they apply. These are of two kinds: issues related to parallelizing the algorithm in question, and issues related to the Fortran 90 implementation. To distinguish between these two, rather different, kind

    标签: Numerical following the Chapters

    上传时间: 2017-04-11

    上传用户:6546544

  • //初始化 initscr() //获得屏幕尺寸 getmaxyx(stdscr, h, w) //画背景 for(i=0 i<h i++)

    //初始化 initscr() //获得屏幕尺寸 getmaxyx(stdscr, h, w) //画背景 for(i=0 i<h i++) for(j=0 j<w j++){ mvaddch(i, j, ACS_CKBOARD) } refresh() //建立窗口 pad = newpad(80, 128) for(i=0 i<80 i++){ char line[128] sprintf(line, "This line in pad is numbered d\n", i) mvwprintw(pad, i, 0, line) } //刷新屏幕 refresh() prefresh(pad, 0, 1, 5, 10, 20, 45) for(i=0 i<50 i++){ prefresh(pad, i+1, 1, 5, 10, 20, 45) usleep(30000) } //等待按键 getch()

    标签: getmaxyx initscr stdscr for

    上传时间: 2014-08-30

    上传用户:龙飞艇

  • Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test c

    Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5

    标签: Implementation calculates algorithm Edmonds

    上传时间: 2014-01-03

    上传用户:kiklkook