10493 search results - page 274 / 2099 » Dynamic Word Problems |
111
click to vote
EOR
2007
15 years 2 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
131
click to vote
CCE
2004
15 years 2 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
123
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Kernel methods have been widely studied in the field of pattern recognition. These methods implicitly map, "the kernel trick," the data into a space which is more approp...
126
Voted
NETCOOP
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
136
click to vote
LSSC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...