16091 search results - page 2915 / 3219 » Solving |
198
click to vote
WAOA
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
202
click to vote
WAOA
2005
Springer
16 years 7 days 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...
166
click to vote
WG
2005
Springer
16 years 7 days ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
179
click to vote
WINE
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
199
click to vote
DEXA
2005
Springer
16 years 7 days ago
2005
Springer
In contrast to alpha-numerical data, multimedia data can have a wide range of quality parameters such as spatial and temporal resolution, and compression format. Users can request ...