Sciweavers

3221 search results - page 387 / 645
» Termination of Linear Programs
Sort
View
AMC
2007
168views more  AMC 2007»
15 years 6 months ago
The method of lines for the numerical solution of a mathematical model for capillary formation: The role of tumor angiogenic fac
In this paper we present the method of lines for the numerical solution of a mathematical model for capillary formation in two space dimensions x,y. We study the tumor angiogenic ...
Arzu Erdem, Serdal Pamuk
CN
2008
118views more  CN 2008»
15 years 6 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
"Real" Slepian-Wolf Codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg
DM
2010
144views more  DM 2010»
15 years 6 months ago
Balanced Cayley graphs and balanced planar graphs
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
Joy Morris, Pablo Spiga, Kerri Webb
EOR
2010
219views more  EOR 2010»
15 years 6 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...