The TSP phase transition - Computer Science and Engineering
... Ian P. Gent a,*, Toby Walsh b*c*l BDepartment of Computer Science, University of Strathclyde, Glasgow Gl IXH, fJK ...
... Ian P. Gent a,*, Toby Walsh b*c*l BDepartment of Computer Science, University of Strathclyde, Glasgow Gl IXH, fJK ...
Retrieval of the diffuse attenuation coefficient Kd(λ)
... • Two-step empirical algorithm with intermediate link – Morel, 2007: • chl-a= 10 ...
... • Two-step empirical algorithm with intermediate link – Morel, 2007: • chl-a= 10 ...
Elsevier Editorial System(tm) for Current Opinion in Neurobiology Manuscript Draft Manuscript Number:
... is available at each state. The goal of the agent is to learn a policy of actions at each state, that will maximize overall rewards. Model-based RL algorithms concentrate on finding an optimal policy when the transition function and the reward function are known (such as when playing chess). Model-f ...
... is available at each state. The goal of the agent is to learn a policy of actions at each state, that will maximize overall rewards. Model-based RL algorithms concentrate on finding an optimal policy when the transition function and the reward function are known (such as when playing chess). Model-f ...
Evolving Neural Networks using Ant Colony Optimization with
... weights to the BP in order to perform a local search improvement. It was also suggested that in problems where heuristic information is not available, ACO needs to be applied with a local search scheme. In fact, training an ANN is one of these problems because it is not possible to consider the valu ...
... weights to the BP in order to perform a local search improvement. It was also suggested that in problems where heuristic information is not available, ACO needs to be applied with a local search scheme. In fact, training an ANN is one of these problems because it is not possible to consider the valu ...
Nonmonotonic inferences in neural networks
... 1987) are resonant systems. Furthermore, it is trival to show that the Harmony networks (Smolensky 1986) also can be described by an equation in the form of (1) and thus are resonant systems too. A common feature of these types of neural networks is that they are based on symmetrical configuration f ...
... 1987) are resonant systems. Furthermore, it is trival to show that the Harmony networks (Smolensky 1986) also can be described by an equation in the form of (1) and thus are resonant systems too. A common feature of these types of neural networks is that they are based on symmetrical configuration f ...
A bio-inspired learning signal for the cumulative learning - laral
... as those of the eye, with noise uniformly distributed in [-0.2; 0.2]. Each resulting motor command, remapped in [-25; 25] degrees, determines the change of one joint angle. The third output unit has binary activation {0; 1}, and controls the grasping action (the activation is determined by the sigmo ...
... as those of the eye, with noise uniformly distributed in [-0.2; 0.2]. Each resulting motor command, remapped in [-25; 25] degrees, determines the change of one joint angle. The third output unit has binary activation {0; 1}, and controls the grasping action (the activation is determined by the sigmo ...
Logic in Computer Science
... Can we solve this problem quickly?? Is there a way to solve this problem which is polynomial and not exponential (in the number of variables and clauses) This is known as the P = NP problem Fundamental question in mathematics and computer science (this is one of the problem of the Clay mathematics i ...
... Can we solve this problem quickly?? Is there a way to solve this problem which is polynomial and not exponential (in the number of variables and clauses) This is known as the P = NP problem Fundamental question in mathematics and computer science (this is one of the problem of the Clay mathematics i ...
Artificial Dendritic Trees
... In the implementation of an electronic system, the number of data pathways in or out of modules is limited by the available technology. Integrated circuit packages rarely exceed 500 pins; our current artificial dendrite chip is in a 40 pin package. This limitation in pin count is of special concern ...
... In the implementation of an electronic system, the number of data pathways in or out of modules is limited by the available technology. Integrated circuit packages rarely exceed 500 pins; our current artificial dendrite chip is in a 40 pin package. This limitation in pin count is of special concern ...
Fast Composition Planning of OWL-S Services and Application
... reach the goal state with a sequence of composed services. For each sub-goal g of the determined goal agenda, at each planning step i, XPlan quickly builds a relaxed planning graph RPG(i) in a fast goal reachability test heuristically ignoring negative effects of actions, and the corresponding relax ...
... reach the goal state with a sequence of composed services. For each sub-goal g of the determined goal agenda, at each planning step i, XPlan quickly builds a relaxed planning graph RPG(i) in a fast goal reachability test heuristically ignoring negative effects of actions, and the corresponding relax ...
Improving Planning Graph Analysis for Artificial Intelligence Planning
... the algorithm assigns the value Product1 to < product > variable when it satisfies the third precondition, and suppose that Product1 in fact does not have any holes at all. When the last precondition is reached, it will not be satisfied so the algorithm will backtrack to the previous decision point ...
... the algorithm assigns the value Product1 to < product > variable when it satisfies the third precondition, and suppose that Product1 in fact does not have any holes at all. When the last precondition is reached, it will not be satisfied so the algorithm will backtrack to the previous decision point ...
Review on Methods of Selecting Number of Hidden Nodes in
... because the network matches the data so closely as to lose its generalization ability over the test data. This paper gives some introduction to artificial neural network and its activation function. Also give information about learning methods of ANN as well as various application of ANN. In this pa ...
... because the network matches the data so closely as to lose its generalization ability over the test data. This paper gives some introduction to artificial neural network and its activation function. Also give information about learning methods of ANN as well as various application of ANN. In this pa ...
DIOS – A Distributed Intelligent Operating Schema
... today a major concern in Europe and in the rest of the world. – In the near future it may contain Chemical, Biological, Radiological or Nuclear (CBRN-E ) agents – It is also reasonable to be used as a tool for threat and as such may be found before its activation. 08Spark Robotics RISE ...
... today a major concern in Europe and in the rest of the world. – In the near future it may contain Chemical, Biological, Radiological or Nuclear (CBRN-E ) agents – It is also reasonable to be used as a tool for threat and as such may be found before its activation. 08Spark Robotics RISE ...
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
... Now a day, many applications used by the civilians and army or police forces require effective face recognition. In this case face recognition is very useful to easily detect the human faces. This face recognition is a very challenging area in computer vision and pattern recognition due to various v ...
... Now a day, many applications used by the civilians and army or police forces require effective face recognition. In this case face recognition is very useful to easily detect the human faces. This face recognition is a very challenging area in computer vision and pattern recognition due to various v ...
decidable
... – The blank tape halting problem is semidecidable if there is a Turing machine M that, given an encoding of TM T, halts and says “yes” if T halts on blank tape, but M fails to halt if T fails to halt on blank tape – The passing problem is semidecidable if there is a Turing machine M that, given an ...
... – The blank tape halting problem is semidecidable if there is a Turing machine M that, given an encoding of TM T, halts and says “yes” if T halts on blank tape, but M fails to halt if T fails to halt on blank tape – The passing problem is semidecidable if there is a Turing machine M that, given an ...
Reinforcement Learning for Neural Networks using Swarm Intelligence
... important performance measurement data since they provide the best approximation of real execution time on conventional computer systems. The value for the SWIRL algorithm is the summation over all the topologies being tested, not just the topology that reached a solution. Evolutionary generations a ...
... important performance measurement data since they provide the best approximation of real execution time on conventional computer systems. The value for the SWIRL algorithm is the summation over all the topologies being tested, not just the topology that reached a solution. Evolutionary generations a ...
NNIntro
... • The experimenter („teacher”) was to expose the neuron to the different patterns and in each case tell it, whether it should fire, or not • The learning algorithm should do best to make neuron do what the teacher requires ...
... • The experimenter („teacher”) was to expose the neuron to the different patterns and in each case tell it, whether it should fire, or not • The learning algorithm should do best to make neuron do what the teacher requires ...
A Hierarchy of Qualitative Representations for Space The Spatial
... Each level of the hierarchy has its own ontology (the set of objects and relations it uses for describing the world) and its own set of inference and problem-solving methods . The objects, relations, and assumptions required by each level are provided by those below it . The dependencies among level ...
... Each level of the hierarchy has its own ontology (the set of objects and relations it uses for describing the world) and its own set of inference and problem-solving methods . The objects, relations, and assumptions required by each level are provided by those below it . The dependencies among level ...
Step back and look at the Science
... The Theological Objection The "Heads in the Sand" Objection The Mathematical Objection (Godel's theorem) The Argument from Consciousness Arguments from Various Disabilities Lady Lovelace's Objection Argument from Continuity in the Nervous System The Argument from Informality of Behaviour Impossibl ...
... The Theological Objection The "Heads in the Sand" Objection The Mathematical Objection (Godel's theorem) The Argument from Consciousness Arguments from Various Disabilities Lady Lovelace's Objection Argument from Continuity in the Nervous System The Argument from Informality of Behaviour Impossibl ...
GA-FreeCell: Evolving Solvers for the Game of FreeCell
... Discrete puzzles, also known as single-player games, are an excellent problem domain for artificial intelligence research, because they can be parsimoniously described yet are often hard to solve [28]. As such, puzzles have been the focus of substantial research in AI during the past decades (e.g., ...
... Discrete puzzles, also known as single-player games, are an excellent problem domain for artificial intelligence research, because they can be parsimoniously described yet are often hard to solve [28]. As such, puzzles have been the focus of substantial research in AI during the past decades (e.g., ...
ⅴ ぇΙ ¦ ¦ of network elements and a set of
... to run. In other words, a ”passive” data-mining approach must be replaced by active, real-time information-gathering and inference systems that can ”ask right questions at the right time”. Moreover, the focus on the cost-efficency and scalability of real-time problem diagnosis is particularly import ...
... to run. In other words, a ”passive” data-mining approach must be replaced by active, real-time information-gathering and inference systems that can ”ask right questions at the right time”. Moreover, the focus on the cost-efficency and scalability of real-time problem diagnosis is particularly import ...
S013513518
... was used to train the network. Result have shown that MLP can achieve an accuracy of 81.85% on Cleveland Heart Diseases dataset. Further we have enhanced Sensitivity, Specificity and Accuracy of MLP, using Dagging approach. MLP with Dagging approach had showed good results and attained accuracy of 8 ...
... was used to train the network. Result have shown that MLP can achieve an accuracy of 81.85% on Cleveland Heart Diseases dataset. Further we have enhanced Sensitivity, Specificity and Accuracy of MLP, using Dagging approach. MLP with Dagging approach had showed good results and attained accuracy of 8 ...
Fighting Knowledge Acquisition Bottleneck with Argument Based
... arguments to explain the examples. Thus, arguments constrain the combinatorial search among possible hypotheses, and also direct the search towards hypotheses that are more comprehensible in the light of expert’s background knowledge. If an ABML method is used on normal examples only (without argume ...
... arguments to explain the examples. Thus, arguments constrain the combinatorial search among possible hypotheses, and also direct the search towards hypotheses that are more comprehensible in the light of expert’s background knowledge. If an ABML method is used on normal examples only (without argume ...