Sciweavers

7015 search results - page 331 / 1403
» Approximation algorithms for co-clustering
Sort
View
AUTOMATICA
2006
67views more  AUTOMATICA 2006»
15 years 6 months ago
Numerical methods for controlled regime-switching diffusions and regime-switching jump diffusions
This work is concerned with numerical methods for controlled regime-switching diffusions, and regime-switching jump diffusions. Numerical procedures based on Markov chain approxim...
Q. S. Song, Gang George Yin, Z. Zhang
JC
2000
45views more  JC 2000»
15 years 6 months ago
What Is the Complexity of Stieltjes Integration?
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
Arthur G. Werschulz
ALGOSENSORS
2010
Springer
15 years 5 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker
ICSM
2002
IEEE
15 years 11 months ago
Evaluating Context-Sensitive Slicing and Chopping
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
Jens Krinke
KR
2004
Springer
16 years 2 days ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen