Sciweavers

1814 search results - page 9 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
GECCO
2009
Springer
14 years 9 days ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
TON
2012
11 years 10 months ago
Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
Yi Shi, Y. Thomas Hou
JMLR
2010
101views more  JMLR 2010»
13 years 2 months ago
Classification Using Geometric Level Sets
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional tha...
Kush R. Varshney, Alan S. Willsky
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
AAIM
2009
Springer
137views Algorithms» more  AAIM 2009»
14 years 2 months ago
On Approximating an Implicit Cover Problem in Biology
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Ar...