Sciweavers

376 search results - page 10 / 76
» Improved Design Debugging Using Maximum Satisfiability
Sort
View
ENTCS
2002
207views more  ENTCS 2002»
13 years 6 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
CEC
2007
IEEE
13 years 10 months ago
A memetic algorithm for dynamic design of wireless sensor Networks
We present a memetic algorithm that dynamically optimizes the design of a wireless sensor network towards energy conservation and extension of the life span of the network, taking ...
Konstantinos P. Ferentinos, Theodore A. Tsiligirid...
AI
2003
Springer
13 years 12 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 10 months ago
Improving evolutionary real-time testing
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...
Marouane Tlili, Stefan Wappler, Harmen Sthamer
CN
2007
221views more  CN 2007»
13 years 6 months ago
Adaptive design optimization of wireless sensor networks using genetic algorithms
We present a multi-objective optimization methodology for self-organizing, adaptive wireless sensor network design and energy management, taking into consideration application-spe...
Konstantinos P. Ferentinos, Theodore A. Tsiligirid...