6274 search results - page 365 / 1255 » From query complexity to computational complexity |
186
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
176
click to vote
HPDC
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes work in progress to develop a standard for interoperability among high-performance scientific components. This research stems from growing recognition that th...
158
click to vote
CSREASAM
2006
15 years 8 months ago
2006
: Traditional state modeling techniques have several limitations. One of these is the reduced ability to model a large number of variables simultaneously. Another limitation is tha...
167
click to vote
AAAI
1997
15 years 8 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
165
click to vote
CPHYSICS
2007
15 years 6 months ago
2007
We describe adaptive continuation algorithms for computing energy levels of the Bose–Einstein condensates (BEC) with emphasis on the rotating BEC. We show that the rotating BEC ...