680 search results - page 129 / 136 » Optimal spot-checking to minimize the computation time in vo... |
GECCO
2004
Springer
14 years 24 days ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
FSTTCS
2009
Springer
14 years 20 hour ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Abstract-- In nanometer-scale VLSI technologies, several interconnect issues like routing congestion and interconnect delay have become the main concerns in placement. However, all...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...