3600 search results - page 605 / 720 » The settling-time reducibility ordering |
170
click to vote
ENTCS
2002
15 years 6 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
173
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
163
click to vote
IPL
2002
15 years 6 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
165
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
A multi-agent system architecture for coordination of just-in-time production and distribution is presented. The problem to solve is two-fold: first the right amount of resources ...
189
click to vote
TCAD
2002
15 years 6 months ago
2002
In this paper, an instruction-level energy model is proposed for the data-path of very long instruction word (VLIW) pipelined processors that can be used to provide accurate power ...