Sciweavers

1702 search results - page 76 / 341
» Doomed program points
Sort
View
ICASSP
2010
IEEE
15 years 5 months ago
Clustering disjoint subspaces via sparse representation
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
Ehsan Elhamifar, René Vidal
INFORMS
1998
100views more  INFORMS 1998»
15 years 4 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
MOR
2002
94views more  MOR 2002»
15 years 4 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
SEUS
2005
IEEE
15 years 10 months ago
Development of Distributed Programming Developing Tool-Kit Based on Object Group Model
In this paper, we defined the concept of the grouped distributed objects[10-14], as a logical unit of distributed application service, and developed a distributed programming deve...
Jeong-Taek Lim, Su-Chong Joo, Chang-Sun Shin
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 10 months ago
A Study of the Role of Single Node Mutation in Genetic Programming
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
Wei Quan, Terence Soule