4539 search results - page 499 / 908 » Approaches to Compute Workflow Complexity |
202
click to vote
WSCG
2003
15 years 8 months ago
2003
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
200
click to vote
AAMAS
2010
Springer
15 years 7 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
183
click to vote
LOGCOM
2007
15 years 6 months ago
2007
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
160
click to vote
RAS
1998
15 years 6 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
194
click to vote
TASLP
2002
15 years 6 months ago
2002
When automatic speech recognition (ASR) and speaker verification (SV) are applied in adverse acoustic environments, endpoint detection and energy normalization can be crucial to th...