13841 search results - page 2698 / 2769 » Algorithms and Constraint Programming |
106
Voted
ISSTA
2004
ACM
15 years 6 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
119
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
111
Voted
ICS
2004
Tsinghua U.
15 years 6 months ago
2004
Tsinghua U.
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
129
Voted
PVG
2003
IEEE
15 years 5 months ago
2003
IEEE
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
108
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...