4110 search results - page 317 / 822 » Efficient algorithms for the 2-gathering problem |
173
click to vote
WWW
2008
ACM
15 years 6 months ago
2008
ACM
As the Internet continues to play an important role in many business applications, it becomes vital to increase the competitive edge by offering geographically tailored contents t...
198
click to vote
JCM
2007
15 years 6 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
265
click to vote
AAAI
2010
15 years 8 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
171
click to vote
TPDS
1998
15 years 6 months ago
1998
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...
169
click to vote
TSMC
2002
15 years 6 months ago
2002
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...