6274 search results - page 578 / 1255 » From query complexity to computational complexity |
216
click to vote
ICICIC
2006
IEEE
16 years 1 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
193
click to vote
VR
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
186
click to vote
PARELEC
2006
IEEE
16 years 1 months ago
2006
IEEE
At our university, we have a number of small-tomedium-size compute clusters and some technical simulations which could benefit from using several of these clusters simulaneously....
163
click to vote
GPC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Due to the few computing resource planning options currently available in Grid computing, capacity planning, an old discipline for analyzing resource purchases, is simple...
173
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...