1292 search results - page 186 / 259 » An Experimental Evaluation of the New OpenMP Tasking Model |
132
Voted
AIIA
2007
Springer
15 years 7 months ago
2007
Springer
The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its appli...
117
click to vote
CIKM
2007
Springer
15 years 7 months ago
2007
Springer
Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These qu...
115
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
111
click to vote
ADBIS
2006
Springer
15 years 7 months ago
2006
Springer
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
ISSTA
2006
ACM
15 years 7 months ago
2006
ACM
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assume-guarantee reasoning. Using rece...