Sciweavers

1101 search results - page 8 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
95
Voted
DAM
2000
137views more  DAM 2000»
14 years 9 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
14 years 10 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
15 years 3 months ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...
AISB
1995
Springer
15 years 1 months ago
Specialised Recombinative Operators for Timetabling Problems
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
Edmund K. Burke, Dave Elliman, Rupert F. Weare
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 3 months ago
A new evolutionary method for time series forecasting
This paper presents a new method — the Time-delay Added Evolutionary Forecasting (TAEF) method — for time series prediction which performs an evolutionary search of the minimu...
Tiago A. E. Ferreira, Germano C. Vasconcelos, Paul...