Sciweavers

16504 search results - page 9 / 3301
» New Problems, New Solutions
Sort
View
JSCIC
2008
79views more  JSCIC 2008»
15 years 7 days ago
A New Ghost Cell/Level Set Method for Moving Boundary Problems: Application to Tumor Growth
Abstract In this paper, we present a ghost cell/level set method for the evolution of interfaces whose normal velocity depend upon the solutions of linear and nonlinear quasi-stead...
Paul Macklin, John Lowengrub
DAM
2007
94views more  DAM 2007»
15 years 8 days ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
117
Voted
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 1 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
MP
2006
138views more  MP 2006»
15 years 7 days ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
JSAC
2007
63views more  JSAC 2007»
15 years 5 days ago
A new survivable mapping problem in IP-over-WDM networks
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
Chang Liu, Lu Ruan