Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,495
Self Adapting Crossover Operator for CSP
"... We are interested in defining a general evolutionary algorithm to solve Constraint Satisfaction Problems, which takes into account both advantages of the systematic and traditional methods and of characteristics of the CSP. In this context knowledge about properties of the constraint network has all ..."
Abstract
- Add to MetaCart
allowed us to define a fitness function, and two operators arc-crossover and arc-mutation. We introduce here a new operator called Self-Adap-arc which uses the idea of self adaptivity and looks at the constraint network during the evolution. This operator is used to improve the stochastic search.
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
- COMPLEX SYSTEMS
, 1999
"... Self-adaptation is an essential feature of natural evolution. However, in the context of function optimization, self-adaptation features of evolutionary search algorithms have been explored only with evolution strategy (ES) and evolutionary programming (EP). In this paper, we demonstrate the selfa ..."
Abstract
-
Cited by 84 (12 self)
- Add to MetaCart
the selfadaptive feature of real-parameter genetic algorithms (GAs) using simulated binary crossover (SBX) operator and without any mutation operator. The connection between the working of self-adaptive ESs and real-parameter GAs with SBX operator is also discussed. Thereafter, the self-adaptive behavior
ASCENT: Adaptive self-configuring sensor networks topologies
, 2004
"... Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low per-node cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks w ..."
Abstract
-
Cited by 449 (15 self)
- Add to MetaCart
are necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract
-
Cited by 2075 (49 self)
- Add to MetaCart
object if one exists. Moreover, a lookup is usually routed to the node nearest the client issuing the lookup (by some measure of proximity), among the nodes storing the requested object. Pastry is completely decentralized, scalable, and self-configuring; it automatically adapts to the arrival, departure
Genetic Programming
, 1997
"... Introduction Genetic programming is a domain-independent problem-solving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring ..."
Abstract
-
Cited by 1056 (12 self)
- Add to MetaCart
genetic operations such as crossover (sexual recombination) and mutation. John Holland's pioneering Adaptation in Natural and Artificial Systems (1975) described how an analog of the evolutionary process can be applied to solving mathematical problems and engineering optimization problems using what
Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks
- IEEE/ACM Transactions on Networking
, 2004
"... This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract
-
Cited by 702 (15 self)
- Add to MetaCart
.11 in several ways: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses a few novel techniques to reduce energy consumption and support self-configuration. It enables low-duty-cycle operation in a multihop network. Nodes form virtual
FFTW: An Adaptive Software Architecture For The FFT
, 1998
"... FFT literature has been mostly concerned with minimizing the number of floating-point operations performed by an algorithm. Unfortunately, on present-day microprocessors this measure is far less important than it used to be, and interactions with the processor pipeline and the memory hierarchy have ..."
Abstract
-
Cited by 602 (4 self)
- Add to MetaCart
FFT literature has been mostly concerned with minimizing the number of floating-point operations performed by an algorithm. Unfortunately, on present-day microprocessors this measure is far less important than it used to be, and interactions with the processor pipeline and the memory hierarchy have
Illusion and well-being: A social psychological perspective on mental health.
- Psychological Bulletin,
, 1988
"... Many prominent theorists have argued that accurate perceptions of the self, the world, and the future are essential for mental health. Yet considerable research evidence suggests that overly positive selfevaluations, exaggerated perceptions of control or mastery, and unrealistic optimism are charac ..."
Abstract
-
Cited by 988 (20 self)
- Add to MetaCart
in normal human cognition (see Fiske& Taylor, 1984; In this article, we review research suggesting that certain illusions may be adaptive for mental health and well-being. In particular, we examine evidence that a set of interrelated positive illusions-namely, unrealistically positive self
Self-Adaptation in Evolutionary Algorithms
- Parameter Setting in Evolutionary Algorithm
, 2006
"... this paper, we will give an overview over the self-adaptive behavior of evolutionary algorithms. We will start with a short overview over the historical development of adaptation mechanisms in evolutionary computation. In the following part, i.e., Section 2.2, we will introduce classification scheme ..."
Abstract
-
Cited by 19 (1 self)
- Add to MetaCart
schemes that are used to group the various approaches. Afterwards, self-adaptive mechanisms will be considered. The overview is started by some examples -- introducing self-adaptation of the strategy parameter and of the crossover operator. Several authors have pointed out that the concept of self-adaptation
Results 1 - 10
of
3,495
