The project Adventure is a simple text-based adventure game. The game, as given, involves the hero trying to find his way from a deep dark forest to home and his true love. There s very little else the player can do apart from moving from place to place. It s not really very interesting. This project can be of use beyond the given, rather boring forest adventure though. You can use it as a basis for developing your own adventure game with different, more interesting commands, areas, items, people and so on. The package ope.adventure contains classes to describe the game world.
标签： game text-based The Adventure
上传时间： 2014-01-15
上传用户：cursor
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
Overview Provides a way to store very large collections of email addresses (100,000+ addresses) and efficiently check whether a specific address is contained in a collection. The collection can be created programmatically, or through a pluggable persistence mechanism. Functionality Maintains large collections of email addresses. Efficiently checks whether an address is in the collection or not.
标签： addresses collections Overview Provides
上传时间： 2013-12-17
上传用户：xg262122
* DEFINITION * This a set of math functions that deal with time. The functions accept * 4-digit time values and 4-digit time of day values. Time values are * interpreted as hours-minutes and are valid if all digits are numeric and * 9 or less, except the second-to-last digit must be 5 or less. Time of day * values are valid if they conform to normally accepted clock values of * 1:00 to 12:59 for a 12-hour clock or 00:00 to 23:59 for a 24-hour clock.
标签： functions DEFINITION accept digit
上传时间： 2014-01-15
上传用户：Divine
* DEFINITION * This is the header file for a library module used to calculate the median * of a list of values. It finds the value that would be in the center if * the list were sorted. If the list contains an even number of values, the * lower of the two center values is reported. The values themselves are not * sorted or modified in any way. This algorithm can be used as a filtering * tool for rejecting noisy data.
标签： DEFINITION calculate the library
上传时间： 2015-09-07
上传用户：refent
A new blind adaptive multiuser detection scheme based on a hybrid of Kalman filter and subspace estimation is proposed. It is shown that the detector can be expressed as an anchored signal in the signal subspace and the coefficients can be estimated by the Kalman filter using only the signature waveform and the timing of the desired user.
标签： multiuser detection adaptive subspace
上传时间： 2015-09-07
上传用户：xieguodong1234
OpenCV means Intel® Open Source Computer Vision Library. It is a collection of C functions and a few C++ classes that implement some popular Image Processing and Computer Vision algorithms. OpenCV has cross-platform middle-to-high level API that consists of a few hundreds (>300) C functions. It does not rely on external libraries, though it can use some when it is possible. OpenCV is free for both non-commercial and commercial use (see the license for details). OpenCV provides transparent interface to Intel® Integrated Performance Primitives (IPP). That is, it loads automatically IPP libraries optimized for specific processor at runtime, if they are available. More information about IPP can be retrieved at http://www.intel.com/software/products/ipp/index.htm -------------------------------------------------------------------------------- 本文是opencv的入门教程
标签： collection functions Computer Library
上传时间： 2015-09-12
上传用户：zhangyi99104144
KPhoneIM is a simple point to point instant messaging application. You may chat with (exactly) one partner directly. The tool needs no server. It may be called from KPhoneSI as external session. Indeed, I develloped the tool mainly to demonstrate KPhoneSI s concept of external sessions!
标签： point application messaging KPhoneIM
上传时间： 2015-09-13
上传用户：lhw888
The information in this publication is believed to be accurate as of its publication date. Such information is subject to change without notice and The ATM Forum is not responsible for any errors. The ATM Forum does not assume any responsibility to update or correct any information in this publication. Notwithstanding anything to the contrary, neither The ATM Forum nor the publisher make any representation or warranty, expressed or implied, concerning the completeness, accuracy, or applicability of any information contained in this publication. No liability of any kind shall be assumed by The ATM Forum or the publisher as a result of reliance upon any information contained in this publication.
标签： publication information believed accurate
上传时间： 2015-09-16
上传用户：1109003457
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-22
上传用户：ruixue198909
