3625 search results - page 222 / 725 » On choosing |
189
click to vote
IANDC
2006
15 years 7 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
180
click to vote
IJSNET
2008
15 years 7 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
180
click to vote
IJVR
2008
15 years 7 months ago
2008
In facility agriculture, it is an urgent problem to design and choose the type and facility of greenhouse based on user's requirements, which are always difficult to express c...
184
click to vote
CN
2007
15 years 7 months ago
2007
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
169
click to vote
IPL
2008
15 years 7 months ago
2008
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...