Sciweavers

1536 search results - page 30 / 308
» Approximately Dominating Representatives
Sort
View
CBMS
2007
IEEE
15 years 9 months ago
Temporal Constraints Approximation from Data about Medical Procedures
Proposing a treatment to patients is one of the physicians’ most common tasks. There are different elements that influence the decision of a physician to propose an appropriate ...
Aida Kamisalic, David Riaño, Francis Real, ...
125
Voted
IPMU
2010
Springer
15 years 7 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 9 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
132
Voted
FOCS
2009
IEEE
15 years 10 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
FOCS
2000
IEEE
15 years 6 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella