Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged for

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Abdelrahman Ogail

Simulated annealing - Wikipedia, the free encyclopedia - 1 views

en.wikipedia.org/...Simulated_annealing

AI AI-In-Games Adaptation

shared by Abdelrahman Ogail on 18 Aug 09 - Cached
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • ...1 more annotation...
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Abdelrahman Ogail on 18 Aug 09
     
    Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration - provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima-which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Abdelrahman Ogail on 18 Aug 09
     
    A natural AI approach
Ahmed Mansour

CRC Cards Tutorial - 0 views

users.csc.calpoly.edu/...crc_b

CRC oop

shared by Ahmed Mansour on 04 Jul 09 - Cached
  • Object Oriented Analysis and Design using CRC Cards
  • A CRC cards is an index card that is use to represent the responsibilities of classes and the interaction between the classes. CRC cards are an informal approach to object oriented modeling. The cards are created through scenarios, based on the system requirements, that model the behavior of the system. The name CRC comes from Class, Responsibilities, and Collaborators which the creators found to be the essential dimensions of object oriented modeling.
    • Ahmed Mansour
      Ahmed Mansour on 04 Jul 09
       
      One of the most popular methods for identifying and categorizing classes is to use class-responsibility-collaboration cards (CRC). Each CRC card represents a single class's data attributes, responsibilities, and collaborations. source : Thought Process Book..
    • Ahmed Mansour
      Ahmed Mansour on 04 Jul 09
       
      You need to create three sections on each card: - The name of the class - The responsibilities of the class - The collaborations of the class
  • Why uses CRC cards?
  • ...4 more annotations...
  • They are portable... No computers are required so they can be used anywhere. Even away from the office. The allow the participants to experience first hand how the system will work. No computer tool can replace the interaction that happens by physically picking up the cards and playing the roll of that object... The are a useful tool for teaching people the object-oriented paradigm. They can be used as a methodology them selves or as a front end to a more formal methodology such as Booch, Wirfs-Brock, Jacobson, etc.
  • Tutorial
    • Ahmed Mansour
      Ahmed Mansour on 04 Jul 09
       
      here we can found simple tutorial for illustration...
  • A CRC cards is an index card that is use to represent the responsibilities of classes and the interaction between the classes. CRC cards are an informal approach to object oriented modeling. The cards are created through scenarios, based on the system requirements, that model the behavior of the system. The name CRC comes from Class, Responsibilities, and Collaborators which the creators found to be the essential dimensions of object oriented modeling.
  • Why uses CRC cards? They are portable... No computers are required so they can be used anywhere. Even away from the office. The allow the participants to experience first hand how the system will work. No computer tool can replace the interaction that happens by physically picking up the cards and playing the roll of that object... The are a useful tool for teaching people the object-oriented paradigm. They can be used as a methodology them selves or as a front end to a more formal methodology such as Booch, Wirfs-Brock, Jacobson, etc.
  • Ahmed Mansour on 04 Jul 09
     
    This is great tutorial for CRC cards ( sort of object oriented modeling approach) \ni think it was useful for me ... hoping to be useful for all of us : ) ..
computersciencej

Routing Table Based Study Material for gate Computer Science - 0 views

GATE study material for computer science Computer Science Study Material for Gate Computer Networks

shared by computersciencej on 11 Dec 17 - No Cached
  • computersciencej on 11 Dec 17
     
    In our previous post Routing Concepts in Computer Networks we have explained the basic introduction of the routing concept. In the continuation of that post now in this article of Computer Science Study Material for Gate, we are going to tell about routing table. In this article provides the information about the different fields of a routing table with a suitable example, what is the use of these fields and how a particular route is selected for the destination host. So let's start with the introduction of routing table. http://www.computersciencejunction.in/2017/12/Study-Material-for-Gate-Computer-Science-routing-table-in-computer-network.html
computersciencej

TCP/IP model questions based Study Material for gate Computer Science - 0 views

Computer Science Study Material for Gate

shared by computersciencej on 17 Nov 17 - No Cached
  • computersciencej on 17 Nov 17
     
    TCP/IP protocol based questions for gate computer science exam Q1.What is the difference between transport and session layer of OSI model. Answer: OSI Model Transport Layer The transport layer uses the services provided by the network layer, such as best path selection and logical addressing, to provide end-to-end communication between source and destination. • The transport -layer data stream is a logical connection between the endpoints of a network. • End-to-end control is provided by sliding windows and reliability in sequencing numbers and acknowledgments. The transport layer regulates information flow to ensure end-to-end connectivity between host applications reliably and accurately. • The TCP/ IP protocol of Layer 4 (t transport t layer ) has two protocols. They are TCP and UDP. The transport layer accepts data from the session layer and segments the data for transport across the network. Generally, the transport layer is responsible for making sure that the data is delivered error-free and in the proper sequence. Flow control generally occurs at the transport layer. OSI Model Session Layer The session layer establishes, manages, and terminates communication sessions. Communication sessions consist of service requests and service responses that occur between applications located on different network devices. These requests and responses are coordinated by protocols implemented at the session layer. The session layer establishes, manages, and terminates sessions between applications Functions of the session layer and the different processes that occur as data packets travel through this layer. More specifically, you learned that Communication sessions consist of mini-conversations that occur between applications located on different network devices. Requests and responses are coordinated by protocols implemented at the session layer. • The session layer decides whether to use two-way simultaneous communication or two-way alternate communicati
computersciencej

Difference Between File Transfer Protocol and Hyper Text Transfer Protocol - 0 views

Computer Science Study Material for Gate GATE study material for computer science

shared by computersciencej on 24 Nov 17 - No Cached
  • computersciencej on 24 Nov 17
     
    In this post under Computer Science Study Material for Gate, we are going to tell the differences between File Transfer Protocol (FTP) and Hypertext Transfer Protocol (HTTP). File Transfer Protocol FTP and HTTP both were developed to make Internet transmission better. FTP is used to exchange files between computer accounts, to transfer files between an account and a desktop computer (upload), or to access software archives on the Internet. It 's also commonly used to download programs and other files to your computer from other servers. It transfers files in two different formats ASCII for text files and Binary format for binary files. To Read full Article click on folowing link http://www.computersciencejunction.in/2017/11/differences-between-ftp-and-http.html
Janos Haits

Compute Library for Deep Neural Networks (clDNN) | 01.org - 0 views

01.org/cldnn

library deep neural networks org artificial intelligence web Artificial-Intelligence online Programming development

shared by Janos Haits on 30 May 17 - No Cached
  • Janos Haits on 30 May 17
     
    "Compute Library for Deep Neural Networks (clDNN) is an open source performance library for Deep Learning (DL) applications intended for acceleration of DL inference on Intel® HD Graphics Driver and  Intel® Iris® graphics (also referred to as Intel® Processor Graphics)."
Janos Haits

GraphQL | A query language for your API - 0 views

graphql.org

query api language data graph facebook rest Computer development Programming technology tools

shared by Janos Haits on 21 Nov 17 - No Cached
  • Janos Haits on 21 Nov 17
     
    'GraphQL is a query language for APIs and a runtime for fulfilling those queries with your existing data. GraphQL provides a complete and understandable description of the data in your API, gives clients the power to ask for exactly what they need and nothing more, makes it easier to evolve APIs over time, and enables powerful developer tools.'
computersciencej

Process Control Block - 0 views

Operating System Study Material Computer Science Study Material for Gate GATE study material for computer science

shared by computersciencej on 03 Mar 18 - No Cached
  • computersciencej on 03 Mar 18
     
    What is Process Control Block ? Today in this Computer Science Study Material for Gate we will discuss about process control block and its various field which provides the information about process. .So let see what is process control block. A Process Control Block is a data structure maintained by the Operating System for every process. Each process has it own data structure. When a process is created then a unique id is assigned to the process Operating system identify a process among all processes on the basis of this process id. A PCB keeps all the information needed to keep track of a process. Generally a process control block contains the following information about a process. To read full tutorial click on the given link http://www.computersciencejunction.in/2018/02/introduction-to-process-control-block-in-operating-system.html
Janos Haits

WireGuard: fast, modern, secure VPN tunnel - 0 views

www.wireguard.com

security networking VPN software privacy opensource tunnel Computer online Service Technology web science tools development

shared by Janos Haits on 04 Feb 20 - No Cached
  • Janos Haits on 04 Feb 20
     
    "WireGuard® is an extremely simple yet fast and modern VPN that utilizes state-of-the-art cryptography. It aims to be faster, simpler, leaner, and more useful than IPsec, while avoiding the massive headache. It intends to be considerably more performant than OpenVPN. WireGuard is designed as a general purpose VPN for running on embedded interfaces and super computers alike, fit for many different circumstances. Initially released for the Linux kernel, it is now cross-platform (Windows, macOS, BSD, iOS, Android) and widely deployable. It is currently under heavy development, but already it might be regarded as the most secure, easiest to use, and simplest VPN solution in the industry."
Janos Haits

Web3  |  Google Cloud - 0 views

cloud.google.com/web3

Computer development technology service computing systems google cloud web3.0

shared by Janos Haits on 13 Nov 22 - No Cached
  • Janos Haits on 13 Nov 22
     
    "Google Cloud for Web3 Build and scale faster with simple, secure tools and infrastructure for Web3. Get co-sell and growth opportunities, like promotion on Marketplace, and support for on- and off-chain governance."
Janos Haits

Proxy: Browse WEB with Proxy - Onion Search Engine - 0 views

proxy.torgateway.com

tools reference proxy browse web technology online service PC onion searchengine engine search engine crypto metasearch science

shared by Janos Haits on 28 Aug 22 - No Cached
  • Janos Haits on 28 Aug 22
     
    "Proxy: Browse WEB Anonymous This is a Proxy to WEB for browse website anonymous. It is a pure proxy that forwards requests for browse website in anonymous. We do not store any data and are not liable for the content."
Islam TeCNo

Design pattern - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...Design_Patterns

patterns

shared by Islam TeCNo on 08 Jun 09 - Cached
  • A pattern must explain why a particular situation causes problems, and why the proposed solution is considered a good one. Christopher Alexander describes common design problems as arising from "conflicting forces" -- such as the conflict between wanting a room to be sunny and wanting it not to overheat on summer afternoons. A pattern would not tell the designer how many windows to put in the room; instead, it would propose a set of values to guide the designer toward a decision that is best for their particular application. Alexander, for example, suggests that enough windows should be included to direct light all around the room. He considers this a good solution because he believes it increases the enjoyment of the room by its occupants. Other authors might come to different conclusions, if they place higher value on heating costs, or material costs. These values, used by the pattern's author to determine which solution is "best", must also be documented within the pattern. A pattern must also explain when it is applicable. Since two houses may be very different from one another, a design pattern for houses must be broad enough to apply to both of them, but not so vague that it doesn't help the designer make decisions. The range of situations in which a pattern can be used is called its context. Some examples might be "all houses", "all two-story houses", or "all places where people spend time." The context must be documented within the pattern. For instance, in Christopher Alexander's work, bus stops and waiting rooms in a surgery are both part of the context for the pattern "A PLACE TO WAIT."
    • Islam TeCNo
      Islam TeCNo on 08 Jun 09
       
      This is Not a CS related articile ....check this link !! http://en.wikipedia.org/wiki/Design_pattern_(computer_science)
  • Mohamed Abd El Monem on 08 Jun 09
     
    Design Patterns
  • Islam TeCNo on 08 Jun 09
     
    Design Patterns
seth kutcher

Two Thumbs Up For Computer Assistance Services - 1 views

I am so happy for the computer assistance that Computer Assistance Online gave me. They provided me with precise and fast solutions to my computer problem. Their computer specialists really know wh...

computer assistance

started by seth kutcher on 02 May 11 no follow-up yet
Janos Haits

Cytoscape: An Open Source Platform for Complex-Network Analysis and Visualization - 0 views

www.cytoscape.org

visualization opensource graph software bioinformatics network data java semantic web semanticweb web3.0 web 3.0 semantic web evolution technology Computer Science Artificial-Intelligence development tools Programming web

shared by Janos Haits on 03 Apr 18 - Cached
  • Janos Haits on 03 Apr 18
     
    Cytoscape is an open source software platform for visualizing complex-networks and integrating these with any type of attribute data. A lot of plugins are available for various kinds of problem domains, including bioinformatics, social network analysis, and semantic web.
Janos Haits

Join the Battle for Net Neutrality - 0 views

www.battleforthenet.com

net neutrality online web internet computer development

shared by Janos Haits on 05 Jul 17 - Cached
  • Janos Haits on 05 Jul 17
     
    "This is a battle for the future of the internet Comcast & Verizon want to end net neutrality so they can control what we see & do online. In 66 days, the FCC will let them, unless we stop it. This is a battle for the Internet's future. Before you do anything else, send a letter to the FCC & Congress now!"
Janos Haits

Wolfram Language for Knowledge-Based Programming - 0 views

www.wolfram.com/language

wolfram language research web online computer development Programming tools technology

shared by Janos Haits on 01 Oct 17 - No Cached
  • Janos Haits on 01 Oct 17
     
    "Designed for the new generation of programmers, the Wolfram Language has a vast depth of built-in algorithms and knowledge, all automatically accessible through its elegant unified symbolic language. Scalable for programs from tiny to huge, with immediate deployment locally and in the cloud, the Wolfram Language builds on clear principles-and three decades of development-to create what promises to be the world's most productive programming language."
Janos Haits

Cookieserve - Free online cookie checker for websites - Enter the URL of your website a... - 0 views

www.cookieserve.com

cookies share report checker websites website scanner url using service tools

shared by Janos Haits on 26 Sep 22 - No Cached
  • Janos Haits on 26 Sep 22
     
    "Free Cookie Checker Tool for Websites Identifying cookies being used and understanding their purpose is a critical step in your website's privacy compliance. Enter the URL of your website and we'll scan it for cookies."
1 - 20 of 168 Next › Last »
Showing 20▼ items per page