4843 search results - page 610 / 969 » The Shortcut Problem - Complexity and Approximation |
142
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
164
click to vote
AIPS
2006
15 years 6 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
192
click to vote
SIROCCO
1997
15 years 5 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
144
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
132
click to vote
AMCS
2010
15 years 4 months ago
2010
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...