7129 search results - page 701 / 1426 » Approximation Algorithms for Treewidth |
189
click to vote
IOR
2006
15 years 7 months ago
2006
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
181
click to vote
JCO
2006
15 years 7 months ago
2006
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
192
click to vote
MLDM
2008
Springer
15 years 7 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
182
click to vote
JAL
2007
15 years 7 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
198
click to vote
CAD
2005
Springer
15 years 7 months ago
2005
Springer
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...