Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged development

Rss Feed Group items tagged

Abdelrahman Ogail

Belief-Desire-Intention software model - Wikipedia, the free encyclopedia - 0 views

  • The Belief-Desire-Intention (BDI) software model (usually referred to simply, but ambiguously, as BDI) is a software model developed for programming intelligent agents. Superficially characterized by the implementation of an agent's beliefs, desires and intentions, it actually uses these concepts to solve a particular problem in agent programming. In essence, it provides a mechanism for separating the activity of selecting a plan (from a plan library) from the execution of currently active plans. Consequently, BDI agents are able to balance the time spent on deliberating about plans (choosing what to do) and executing those plans (doing it). A third activity, creating the plans in the first place (planning), is not within the scope of the model, and is left to the system designer and programmer.
    • Abdelrahman Ogail
       
      Stress on the point "BDI Agents spent time about choosing what to do more that how to execute them"
Abdelrahman Ogail

Mutation testing - Wikipedia, the free encyclopedia - 1 views

  • Mutation testing (or Mutation analysis) is a method of software testing, which involves modifying program's source code in small ways.[1] These, so-called mutations, are based on well-defined mutation operators that either mimic typical programming errors (such as using the wrong operator or variable name) or force the creation of valuable tests (such as driving each expression to zero). The purpose is to help the tester develop effective tests or locate weaknesses in the test data used for the program or in sections of the code that are seldom or never accessed during execution.
  • For example, consider the following C++ code fragment: if (a && b) c = 1; else c = 0; The condition mutation operator would replace '&&' with '||' and produce the following mutant: if (a || b) c = 1; else c = 0;
  • Many mutation operators can produce equivalent mutants. For example, consider the following code fragment: int index=0; while (...) { . . .; index++; if (index==10) break; } Boolean relation mutation operator will replace "==" with ">=" and produce the following mutant: int index=0; while (...) { . . .; index++; if (index>=10) break; }
Janos Haits

Ohloh, the open source network - 1 views

  •  
    Discover, Track and Compare Open Source
Ahmed Mansour

JAVA Developer's Guide Book - 2 views

  • JAVA Developer's Guide
  •  
    really great reference for who want to learn Java ... (Y)
Janos Haits

Gitea - 0 views

  •  
    "A painless self-hosted Git service. Gitea is a community managed fork of Gogs, lightweight code hosting solution written in Go and published under the MIT license."
Janos Haits

Wolfram Neural Net Repository of Neural Network Models - 1 views

  •  
    "The Wolfram Neural Net Repository is a public resource that hosts an expanding collection of trained and untrained neural network models, suitable for immediate evaluation, training, visualization, transfer learning and more."
Janos Haits

Home | Solid - 0 views

  •  
    "Solid was created by the inventor of the World Wide Web, Sir Tim Berners-Lee. Its mission is to reshape the web as we know it. Solid will foster a new breed of applications with capabilities above and beyond anything that exists today."
Janos Haits

EUCOG - European Network for the Advancement of Artificial Cognitive Systems, Interacti... - 0 views

  •  
    "EUCog - European Network for the Advancement of Artificial Cognitive Systems, Interaction and Robotics"
Janos Haits

The CLIP OS Project | CLIP OS - 0 views

  •  
    "The CLIP OS project is an open source project maintained by the ANSSI (National Cybersecurity Agency of France) that aims to build a hardened, multi-level operating system, based on the Linux kernel and a lot of free and open source software."
Janos Haits

The Freenet Project - /index - 0 views

  •  
    Freenet is free software which lets you anonymously share files, browse and publish "freesites" (web sites accessible only through Freenet) and chat on forums, without fear of censorship. Freenet is decentralised to make it less vulnerable to attack, and if used in "darknet" mode, where users only connect to their friends, is very difficult to detect. Share files, chat on forums, browse and publish, anonymously and without fear of blocking or censorship! Then connect to your friends for even better security! "
Janos Haits

Steem.io - 0 views

  •  
    "Steem powers Smart Media Tokens Steem is a blockchain-based rewards platform for publishers to monetize content and grow community."
Janos Haits

Research at Google - 0 views

  •  
    "We are a machine intelligence team focused on deep learning. We advance the state of the art in order to have a positive impact on the world."
Janos Haits

VIVO | connect - share - discover - 0 views

  •  
    An interdisciplinary network Enabling collaboration and discovery among scientists across all disciplines.
Janos Haits

Blockstack, building the decentralized internet - 0 views

  •  
    "A New Internet for Decentralized Apps Blockstack is a new decentralized internet where users own their data and apps run locally. A browser portal is all that's needed to get started."
Janos Haits

PureOS - 0 views

  •  
    "A user friendly, secure and freedom respecting OS for your daily usage. With PureOS, you are the only one in control of your digital life. CHECK OUT THE APPLICATIONS"
Janos Haits

Colaboratory - Google - 0 views

  •  
    "Colaboratory is a research project created to help disseminate machine learning education and research. It's a Jupyter notebook environment that requires no setup to use. For more information, see our FAQ. Click the button below to be added to the waitlist"
Janos Haits

Project Jupyter | Home - 0 views

  •  
    "Open source, interactive data science and scientific computing across over 40 programming languages."
« First ‹ Previous 61 - 80 of 225 Next › Last »
Showing 20 items per page