Sciweavers

10901 search results - page 391 / 2181
» Approximations in Distributed Optimization
Sort
View
TON
2010
197views more  TON 2010»
15 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
13 years 9 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
ISSAC
2007
Springer
111views Mathematics» more  ISSAC 2007»
16 years 1 months ago
Numerical optimization in hybrid symbolic-numeric computation
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
Lihong Zhi
WSC
2000
15 years 8 months ago
A practical approach to sample-path simulation optimization
We propose solving continuous parametric simulation optimizations using a deterministic nonlinear optimization algorithm and sample-path simulations. The optimization problem is w...
Michael C. Ferris, Todd S. Munson, Krung Sinapirom...
WIOPT
2010
IEEE
15 years 5 months ago
Optimal monotone forwarding policies in delay tolerant mobile ad hoc networks with multiple classes of nodes
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
Francesco De Pellegrini, Eitan Altman, Tamer Basar