Sciweavers

520 search results - page 13 / 104
» Reductions Between Expansion Problems
Sort
View
EOR
2002
80views more  EOR 2002»
13 years 8 months ago
On generalized semi-infinite optimization and bilevel optimization
The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a sp...
Oliver Stein, Georg Still
ISMIS
2003
Springer
14 years 1 months ago
Searching for the Complex Decision Reducts: The Case Study of the Survival Analysis
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
Jan G. Bazan, Andrzej Skowron, Dominik Slezak, Jak...
FOCS
2010
IEEE
13 years 6 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
COLT
1995
Springer
14 years 8 days ago
A Comparison of New and Old Algorithms for a Mixture Estimation Problem
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
David P. Helmbold, Yoram Singer, Robert E. Schapir...
ICCBR
2007
Springer
14 years 18 days ago
When Similar Problems Don't Have Similar Solutions
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
Stewart Massie, Susan Craw, Nirmalie Wiratunga