7167 search results - page 1143 / 1434 » Answer Set Programming |
127
Voted
MICRO
2003
IEEE
15 years 8 months ago
2003
IEEE
Silicon technology will continue to provide an exponential increase in the availability of raw transistors. Effectively translating this resource into application performance, how...
120
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
133
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
125
click to vote
ICALP
2003
Springer
15 years 8 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 ...
125
Voted
IPPS
1996
IEEE
15 years 7 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...