11740 search results - page 121 / 2348 » More Problems in Rewriting |
143
Voted
ENTCS
2002
15 years 17 days ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
104
Voted
SIAMSC
2010
14 years 7 months ago
2010
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
142
click to vote
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
RTSS
1999
IEEE
15 years 5 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
90
Voted
AAAI
2000
15 years 2 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...