Sherwood算法消除最壞實例，以達到對任何實例都能有好的性能的效果 文件： rd_list.c --> create a random sequence of n integers not equal to each Other list.c --> create a descending sequence of n integers not equal to each Other sherwood.c --> 就是該算法，靜態鏈表的長度默認設為1000，可在宏定義處修改 用法： gcc -o sherwood sherwood.c gcc -o rd_list rd_list.c gcc -o list list.c ./rd_list s.txt 1000 產生一個長度為1000的互不相等的隨機序列，保存在s.txt中 ./list s1.txt 1000 產生一個長度為1000的互不相等的降序序列，保存雜s1.txt中 ./sherwood s1.txt 運行算法，比較其中的4個算法的性能差異
上傳時間： 2016-01-20
上傳用戶：ainimao
You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your private data, one for the common data in order to receive data from Other applications like Excel, WinWord etc. and at last, I ll give you a handy-dandy class you can derive ANY MFC object from, to make it a drop target
標簽： possibility imagine Right there
上傳時間： 2013-12-21
上傳用戶：jichenxi0730
TFIND searches for one or more strings (boolean AND) in a text file. TFIND reports all lines where the string(s) were found (or NOT found by option). The search can be limited to a field in a fixed field (i.e. column oriented) list. An extended search mode is available, where only letters and digits are relevant. Other options: case sensitive search, alternative errorlevel with number of hits, header line with file name, LFN, custom prefix
標簽： TFIND searches boolean reports
上傳時間： 2016-01-24
上傳用戶：lindor
Mod_python is an Apache module that embeds the Python interpreter within the server. With mod_python you can write web-based applications in Python that will run many times faster than traditional CGI and will have access to advanced features such as ability to retain database connections and Other data between hits and access to Apache internals. A more detailed description of what mod_python can do is available in this O Reilly article.
標簽： interpreter Mod_python mod_python the
上傳時間： 2016-01-25
上傳用戶：yd19890720
This a collection of MATLAB functions for extended Kalman filtering, unscented Kalman filtering, particle filtering, and miscellaneous Other things. These utilities are designed for reuse and I have found them very useful in many projects. The code has been vectorised for speed and is stable and fast.
標簽： filtering Kalman collection functions
上傳時間： 2013-12-23
上傳用戶：ljmwh2000
This the fourth edition of the Writing Device Drivers articles. This article will introduce the idea of device stacks and how devices interact with each Other. We will use the previously created example device driver to demonstrate this topic. To do this we will introduce the idea of a “filter” driver in which we will create to attach to our own driver’s device stack.
標簽： the This introduce articles
上傳時間： 2016-01-28
上傳用戶：CSUSheep
This the third edition of the Writing Device Drivers articles. The first article helped to simply get you acquainted with device drivers and a simple framework for developing a device driver for NT. The second tutorial attempted to show to use IOCTLs and display what the memory layout of Windows NT is. In this edition, we will go into the idea of contexts and pools. The driver we write today will also be a little more interesting as it will allow two user mode applications to communicate with each Other in a simple manner. We will call this the “poor man’s pipes” implementation.
標簽： the articles Drivers edition
上傳時間： 2014-01-16
上傳用戶：ommshaggar
OpenSVM was developped under Visual C++ 6.0 SP6, You can open the workspace file(*.dsw) in the opensvm-src folder. The folder include the svm.h and svm.cpp which in the libsvm (Copyright (c) 2000-2007 Chih-Chung Chang and Chih-Jen Lin All rights reserved) in the opensvm-src\libsvm. However, the files svm.h and svm.cpp codes were copied/merged into stdafx.h and stdafx.cpp in order to support the development, and OpenSVM still use Other codes of libsvm. So you can see the libsvm package in the source package. You can open and build it with Visual C++ 6.0. Note: the problems must be in LIBSVM format. OpenSVM project page: http://sourceforge.net/projects/opensvm If you had any question, please mail to: cloudbyron@gmail.com
標簽： developped the workspace OpenSVM
上傳時間： 2016-01-30
上傳用戶：asdfasdfd
A web crawler (also known as a web spider or web robot) is a program or automated script which browses the in a methodical, automated manner. Other less frequently used names for web crawlers are ants, automatic indexers, bots, and worms (Kobayashi and Takeda, 2000).來源。
標簽： web automated crawler program
上傳時間： 2016-02-01
上傳用戶：釣鰲牧馬
Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the number ‘1’. All free, valid squares north, south, east and west around the number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid squares around the two are marked with a ‘3’ and the process is repeated iteratively until : The exit is found (a free square Other than the starting position is reached on the very edge of the maze), or, No more free squares are available, and hence no exit is possible.
標簽： method ink-blotting Blotting escaping
上傳時間： 2014-12-03
上傳用戶：123啊
