A subclass of JTable, this class can render data from a TreeTableModel.
標(biāo)簽： TreeTableModel subclass JTable render
上傳時(shí)間： 2015-05-04
上傳用戶：dongqiangqiang
An implementation of merge sort.
標(biāo)簽： implementation merge sort An
上傳時(shí)間： 2015-05-04
上傳用戶：JasonC
A model of the local file system, implemented as a concrete subclass of AbstractTreeTableModel. This class implements the TreeTableModel interface.
標(biāo)簽： AbstractTreeTableModel implemented concrete subclass
上傳時(shí)間： 2015-05-04
上傳用戶：彭玖華
Determine Status of Printer with Explanation.
標(biāo)簽： Explanation Determine Printer Status
上傳時(shí)間： 2015-05-05
上傳用戶：CSUSheep
computing singular value of matrix by iteration
標(biāo)簽： computing iteration singular matrix
上傳時(shí)間： 2014-01-16
上傳用戶：lx9076
Deleting a node of RB-Tree without recurrence
標(biāo)簽： recurrence Deleting RB-Tree without
上傳時(shí)間： 2015-05-05
上傳用戶：yuzsu
For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
標(biāo)簽： the representation incomplete methods
上傳時(shí)間： 2015-05-05
上傳用戶：1159797854
The subject which is to us propos¨¦ is as follows: calculation of the degr¨¦ d¡ ¯ inconsistance d¡ ¯ un logical program possibilist in C++. We thus work on a logical program possibilist, it be-¨¤-statement a logical program resulting from non-classique logic. The goal first of this project is of d¨¦ terminer if a logical program is consisting or not of share the calculation of sound degr¨¦ d¡ ¯ inconsistance.
標(biāo)簽： brvbar calculation subject follows
上傳時(shí)間： 2013-12-18
上傳用戶：yulg
The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pascal to implement Splay Trees. This program compresses and decompresses files, and does a pretty good job of it. Contents: SPLAY.PAS Original TP source code SPLAY.C Translation of code to C SPLAY.EXE Compiled version of SPLAY.C (small model) README.DOC You are looking at it Read the comments at the beginning of SPLAY.C for more info.
標(biāo)簽： program translation Kokkonen pascal
上傳時(shí)間： 2015-05-05
上傳用戶：rocwangdp
parallel cascade identification of nonlinear system
標(biāo)簽： identification nonlinear parallel cascade
上傳時(shí)間： 2015-05-06
上傳用戶：希醬大魔王
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
