Sciweavers

840 search results - page 66 / 168
» The Complexity of the Extended GCD Problem
Sort
View
IWCMC
2006
ACM
14 years 1 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
ICML
2007
IEEE
14 years 8 months ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 15 days ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
COCOA
2008
Springer
13 years 9 months ago
Parameterized Graph Editing with Chosen Vertex Degrees
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
Luke Mathieson, Stefan Szeider
AAAI
2006
13 years 9 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen