Sciweavers

65 search results - page 13 / 13
» A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem
Sort
View
MOBICOM
2006
ACM
13 years 11 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 5 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
13 years 10 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...
ANOR
2005
160views more  ANOR 2005»
13 years 5 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
13 years 10 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry