2498 search results - page 368 / 500 » Data Structures with Unpredictable Timing |
103
click to vote
WSC
2007
15 years 5 months ago
2007
Two discrete-event simulations are developed to assess the feasibility of improving the delivery process of reinforced concrete structures. The simulations represent the resource ...
143
click to vote
CASES
2008
ACM
15 years 4 months ago
2008
ACM
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
116
Voted
CSC
2008
15 years 4 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
126
Voted
LREC
2008
15 years 4 months ago
2008
Dating of contents is relevant to multiple advanced Natural Language Processing (NLP) applications, such as Information Retrieval or Question Answering. These could be improved by...
125
Voted
SIROCCO
2008
15 years 4 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...