Sciweavers

4266 search results - page 110 / 854
» The container loading problem
Sort
View
127
Voted
ESCIENCE
2005
IEEE
15 years 8 months ago
A Distributed Problem Solving Environment (PSE) for Scientific Computing
A distributed Problem Solving Environment (PSE) is proposed to help users solve partial differential equation (PDE) based problems in scientific computing. The system inputs a pro...
Shigeo Kawata, Hideaki Fuju, Hideaki Sugiura, Yuic...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 7 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
98
Voted
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
15 years 4 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 9 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
COMPGEOM
2009
ACM
15 years 9 months ago
On the set multi-cover problem in geometric settings
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...