Sciweavers

356 search results - page 22 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
MOC
1998
126views more  MOC 1998»
13 years 7 months ago
Implicit-explicit multistep finite element methods for nonlinear parabolic problems
We approximate the solution of initial boundary value problems for nonlinear parabolic equations. In space we discretize by finite element methods. The discretization in time is b...
Georgios Akrivis, Michel Crouzeix, Charalambos Mak...
SIAMDM
2000
159views more  SIAMDM 2000»
13 years 7 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer
GLOBECOM
2009
IEEE
13 years 5 months ago
Received Signal Strength-Based Wireless Localization via Semidefinite Programming
The received signal strength (RSS)-based approach to wireless localization offers the advantage of low cost and easy implementability. To circumvent the nonconvexity of the convent...
Wentao Robin Ouyang, Albert Kai-Sun Wong, Chin-Tau...
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
14 years 23 days ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
RTAS
2006
IEEE
14 years 1 months ago
Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
Sathish Gopalakrishnan, Marco Caccamo