Sciweavers

13376 search results - page 41 / 2676
» Problem Solving with
Sort
View
CSC
2009
15 years 1 months ago
A New Iterative Method for Solving Initial Value Problems
- In this paper, we introduce a new parameter iteration method (P-Iteration for short) which can be applied on Adams-Moulton methods to solve initial value problems. Compared with ...
Mingshen Wu, Weihu Hong
92
Voted
AMC
2005
154views more  AMC 2005»
15 years 18 days ago
Solving Laplacian problems with boundary singularities: a comparison of a singular function boundary integral method with the p/
We solve a Laplacian problem over an L-shaped domain using a singular function boundary integral method as well as the p/hp finite element method. In the former method, the soluti...
Miltiades Elliotis, Georgios Georgiou, Christos Xe...
123
Voted
CEC
2008
IEEE
15 years 7 months ago
Solving deceptive problems using a genetic algorithm with reserve selection
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
GECCO
2000
Springer
109views Optimization» more  GECCO 2000»
15 years 4 months ago
GP+Echo+Subsumption = Improved Problem Solving
Real-time, adaptive control is a difficult problem that can be addressed by EC architectures. We are interested in incorporating into an EC architecture some of the features that ...
William F. Punch, W. M. Rand
103
Voted
IJMC
2006
84views more  IJMC 2006»
15 years 20 days ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan