5606 search results - page 630 / 1122 » Randomization Techniques for Graphs. |
145
click to vote
DELTA
2004
IEEE
15 years 10 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
206
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
207
click to vote
RTSS
1995
IEEE
15 years 10 months ago
1995
IEEE
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...
154
click to vote
COLING
2000
15 years 8 months ago
2000
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
180
click to vote
AIPS
1996
15 years 8 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...