Browsing projects by Tag(s)

Select a tag to browse associated projects and drill deeper into the tag cloud.

Showing page 1 of 1

Wintermute is the attempt of Danté Ashton and a group of others to implement the world's first personal edition of an intelligent framework of applications and libraries, and in the future, an intelligent operating system. This is the brainchild of the [http://www.thesii.org/ SII]. Wintermute ... [More] bolsters the capabilities of using neural networking to learn about its host, a pseudo-langauge engine that permits translations and grammar rulesets of any language to be incorporated into the system, and database downloads of different sets of data to permit the combination of the world's first personal virtual self-thinking assistant. It can be used to perform simple tasks like dictation to a favorite word editor to more complex tasks, like sorting documents depending .. [Less]

5.0
 
  0 reviews  |  1 user  |  16,068 lines of code  |  2 current contributors  |  Analyzed about 1 month ago
 
 

Just what the summary says, robots written for Robocode.

0
 
  0 reviews  |  0 users  |  915 lines of code  |  0 current contributors  |  Analyzed 9 days ago
 
 

Overviewevanescent is a collection of tools for reasoning in propositional logic and provides implementations of inference engines in the D programming language. The project is meant to be a useful library for reasoning with propositional logic supporting various computational problems (e.g. ... [More] SAT) and various algorithms for these problems. a collection of efficient implementations based on state-of-the-art techniques a platform for experiments with novel algorithms and implementation techniques a stress test for the D programming language that allows to evaluate how suitable D is for developing high performance inference engines for hard computational problems StatusFor now the library focusses only on algorithms for the classical propositional satisfiability problem (SAT). The library includes a state-of-the-art SAT solver deescover written in D. At present, the deescover represents a port of the excellent MiniSAT solver written in C++ by Niklas Eén and Niklas Sörensson. deescover provides support for incremental SAT solving, i.e. solving series of similar SAT problems, as it is e.g. common for bounded-model checking and AI planning applications. Future PlansOne line of work will be the improvement and optimization of the search-based SAT solver deescover. First steps in this direction are ongoing. This includes low-level datastructure and representational changes as well as work on the heuristic parts of the solver. For instance, we want to add a variant of deescover that implements Decision-making with a Reference Point (DMRP) that has been introduced in 2008 by Goldberg. We might further add alternative algorithmic approaches to solve the SAT problem: local-search based algorithms (e.g. WalkSAT , UnitWalk) and some suppport for ordered binary decision diagrams (OBDDs) (perhaps simply an object-oriented wrapper to the CUDD library). Another line of work will be on introducing algorithms that can work with non-CNF based input, but with general formulae in propositional logic. It is well-known that such solver can outperform CNF-based solvers in specific applications. Concretely, we want to develop a DPLL-based Circuit-SAT solver. Further, we aim at providing fast and memory-efficient algorithms to the all-solutions SAT problem, i.e. compute all models of given a propositional formula. Such algorithms are interesting for model checking applications or compilation of formulae to OBDDs for instance. In the long run, we may also extend the library by algorithms for non-standard inference tasks which became interesting only recently and have applications in AI and Bioinformatics, e.g. weighted SAT-problems, pseudo-boolean constraints, model counting etc. Available Tools and Inference EnginesThe following inference engines and tools are part of the evanescent library: Deescover: a search-based SAT-solver in the style of CHAFF and MiniSAT with support for incremental SAT solving. ApplicationsTo demonstrate the use of the tools in the evanescent toolbox, we include the following applications DeescoverSUDOKU: a fast solver for general SUDOKU puzzles based on the Deescover SAT solver. NewsApril 26, 2009: Released the evanescent tool suite version 0.1 Released version 0.1 of the Deescover SAT solver. Released DeescoverSUDOKU version 0.1 Related Sitesevanescent is also listed at the major forum for open-source projects in D, DSource.org. [Less]

0
 
  0 reviews  |  0 users  |  3,637 lines of code  |  0 current contributors  |  Analyzed 2 days ago
 
 

Face biometric inspector is aimed to create platform for evaluation various face recognition algorithms. Currently it's possible to create simple database of person and to do simple classification based on sparse representation.

0
 
  0 reviews  |  0 users  |  0 current contributors  |  Analyzed 4 days ago
 
 

This is a python-based Go game, which I'm attempting to write an AI for. # Will write more a better description later. # I might also put my ALife simulation here one day.

0
 
  0 reviews  |  0 users  |  0 current contributors  |  Analyzed 5 days ago
 
 

PyGtalkRobot is an open source python gtalk bot framework using XMPPPY library referencing the source code of python-jabberbot. IntroductionInstant Message(IM) bot is very convenient and helpful for users. Users can just type a few of words to get what they needs, no need to open a browser or ... [More] other software. There are many IM bots that can serve users very conveniently, for example, mini blog bots(such as http://fanfou.com/ ), dictionary bots( such as a Chinese-English dictionary bot imdict@imdict.net), RSS bots(such as anothr@gmail.com). PyGtalkRobot is an open source python gtalk bot framework for developing Gtalk bot very easily. You can just write tens of lines of python code to make your own bots online. PyGtalkRobot use Regular Expression Pattern as the command controller, which means you can develop very complicated command system and more intelligent Gtalk bots. DetailsSuch as: command 1: email ldmiao@gmail.com hello, nice to meet you means send an email to ldmiao@gmail.com with subject hello and content nice to meet you and command 2: email is a very convenient way to communicate with friends. means just save the content to the chat history for further use. These two commands can be distinguished by regular expression: command 1: (email)\s+(.*?@.+?)\s+(.*?),\s*(.*?) command 2: (.*) In which, command 1 have the higher priority than command 2. InstallPrerequisitePython 2.4+: http://www.python.org/ or ActivePython:http://www.activestate.com/Products/activepython/ Dependenciesxmpppy: http://xmpppy.sourceforge.net/ pydns: http://pydns.sourceforge.net/ InstallCheckout the source code form SVN server: svn checkout http://pygtalkrobot.googlecode.com/svn/trunk/pygtalkrobot/src pygtalkrobot-read-only How to UseJust import the lib PyGtalkRobot.py: from PyGtalkRobot import GtalkRobot. Subclass the GtalkRobot class Add methods starting with command_, these will be exported as commands (e.g. def command_01_display_id(self, user, message, args)); The methods should send the message (or None if the command gives no reply) back to the user using method replyMessage(self, user, message) Create an instance of your bot, supplying username and password Call the start() method of your instance Please reference the sampleRobot.py for a sample. Sample Bot code(python syntax highlighted download) import sys import time from PyGtalkRobot import GtalkRobot ######################################################################################### class SampleBot(GtalkRobot): #Regular Expression Pattern Tips: # I or IGNORECASE (?i) case insensitive matching # L or LOCALE (?L) make \w, \W, \b, \B dependent on the current locale # M or MULTILINE (?m) matches every new line and not only start/end of the whole string # S or DOTALL (?s) '.' matches ALL chars, including newline # U or UNICODE (?u) Make \w, \W, \b, and \B dependent on the Unicode character properties database. # X or VERBOSE (?x) Ignores whitespace outside character sets #"command_" is the command prefix, "001" is the priviledge num, "setState" is the method name. #This method is used to change the state and status text of the bot. def command_001_setState(self, user, message, args): #the __doc__ of the function is the Regular Expression of this command, if matched, this command method will be called. #The parameter "args" is a list, which will hold the matched string in parenthesis of Regular Expression. '''(available|online|on|busy|dnd|away|idle|out|off|xa)( +(.*))?$(?i)''' show = args[0] status = args[1] jid = user.getStripped() # Verify if the user is the Administrator of this bot if jid == 'ldmiao@gmail.com': print jid, " ---> ",bot.getResources(jid), bot.getShow(jid), bot.getStatus(jid) self.setState(show, status) self.replyMessage(user, "State settings changed!") #This method is used to send email for users. def command_002_SendEmail(self, user, message, args): #email ldmiao@gmail.com hello dmeiao, nice to meet you, bla bla ... '''[email|mail|em|m]\s+(.*?@.+?)\s+(.*?),\s*(.*?)(?i)''' email_addr = args[0] subject = args[1] body = args[2] #call_send_email_function(email_addr, subject, body) self.replyMessage(user, "\nEmail sent to "+ email_addr +" at: "+time.strftime("%Y-%m-%d %a %H:%M:%S", time.gmtime())) #This method is used to response users. def command_100_default(self, user, message, args): '''.*?(?s)(?m)''' self.replyMessage(user, time.strftime("%Y-%m-%d %a %H:%M:%S", time.gmtime())) ######################################################################################### if __name__ == "__main__": bot = SampleBot() bot.setState('available', "Simple Gtalk Robot") bot.start("account_name@gmail.com", "password") Related projectspython-jabberbot: A simple Jabber Bot for Python: http://thpinfo.com/2007/python-jabberbot/ [Less]

0
 
  0 reviews  |  0 users  |  640 lines of code  |  0 current contributors  |  Analyzed 10 days ago
 
 

Greetings! Clay Busbeiy is the algorithm platform that addresses the needs of automation/robotics creation. This platform is based on the OpenTheorem™ format, and is configured as cellular combinatoric output.

0
 
  0 reviews  |  0 users  |  0 current contributors
 
 

Develop site for PUB CS projects.

0
 
  0 reviews  |  0 users  |  10,071 lines of code  |  0 current contributors  |  Analyzed 11 days ago
 
 
Compare

An RTS AI for the spring engine

0
 
  0 reviews  |  0 users  |  48,869 lines of code  |  0 current contributors  |  Analyzed almost 2 years ago
 
 

The Rogue-Opcode game framework is a simple, cross-platform game development library written in C++. It is developed as an academic research project, investigating novel applications of established adaptive computational intelligence methods to game design, suitable for commercial titles. The effort ... [More] is partly subsidized by the LSAMP program at San Diego State University. Chief features and design goals: Portable Uses cross-platform libraries ISO standard C++ Simple and Easy to Use Modular design Minimalist class interfaces Quick and Lightweight Avoids code bloat Doesn't sacrifice power Highly Scalable Great for small, "casual" games Suitable for large action titles Powerful and Unique Scripting Language Custom built from the ground up Many useful paradigms and features Procedural Graphics and Sound Support Generate music, sound effects and stunning visuals directly from code Access this full functionality from your scripts Create exactly that effect you were imagining Pervasive AI Adaptive algorithms at every level of game logic control Artificial Immune Systems Modified Classifiers Genetic Algos [Less]

0
 
  0 reviews  |  0 users  |  3,847 lines of code  |  0 current contributors  |  Analyzed 7 days ago
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.