1407 search results - page 128 / 282 » Using Use Cases in Executable Z |
135
click to vote
AIPS
2006
15 years 5 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
145
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Graphics Processing Units (GPUs) have been growing in popularity due to their impressive processing capabilities, and with general purpose programming languages such as NVIDIA’s...
152
click to vote
EUROSYS
2011
ACM
14 years 8 months ago
2011
ACM
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
233
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
119
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
When a program uses Software Transactional Memory (STM) to synchronize accesses to shared memory, the performance often depends on which STM implementation is used. Implementation...