14548 search results - page 338 / 2910 » The Optimal Path-Matching Problem |
168
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
190
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
227
click to vote
MOR
2007
15 years 6 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
196
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
144
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...