Sciweavers

2182 search results - page 304 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 2 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
JCSS
2010
102views more  JCSS 2010»
15 years 28 days ago
Matching and alpha-equivalence check for nominal terms
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
Christophe Calvès, Maribel Fernández
124
Voted
GECCO
2008
Springer
114views Optimization» more  GECCO 2008»
15 years 3 months ago
Strategic positioning in tactical scenario planning
Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for op...
James M. Whitacre, Hussein A. Abbass, Ruhul A. Sar...
DCOSS
2009
Springer
15 years 9 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
NIPS
2003
15 years 3 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini