1208 search results - page 40 / 242 » Uniform eventown problems |
163
click to vote
NETWORKS
2010
15 years 5 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
181
click to vote
SLS
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
167
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
This paper deals with the approximation of the buckling coefficients and modes of a clamped plate modeled by the Reissner-Mindlin equations. These coefficients are related with the...
262
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
152
click to vote
ICRA
2007
IEEE
16 years 27 days ago
2007
IEEE
— This paper discusses the problem of generating patrol paths for a team of mobile robots inside a designated target area. Patrolling requires an area to be visited repeatedly by...