Sciweavers

1263 search results - page 81 / 253
» A* with Bounded Costs
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
A Compile-Time Partitioning Strategy for Non-Rectangular Loop Nests
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...
Rizos Sakellariou
COCOON
2004
Springer
15 years 10 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
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
ICSE
2008
IEEE-ACM
16 years 7 months ago
Time-bounded adaptation for automotive system software
Software is increasingly deployed in vehicles as demand for new functionality increases and cheaper and more powerful hardware becomes available. Likewise, emerging wireless commu...
Aline Senart, Douglas C. Schmidt, Serena Fritsch, ...
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 3 months ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar