218 search results - page 17 / 44 » Constant Rate Approximate Maximum Margin Algorithms |
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...