Sciweavers

1920 search results - page 169 / 384
» The Complexity of the A B C Problem
Sort
View
EWCBR
2000
Springer
15 years 10 months ago
Remembering Why to Remember: Performance-Guided Case-Base Maintenance
An important focus of recent CBR research is on how to develop strategies for achieving compact, competent case-bases, as a way to improve the performance of CBR systems. However, ...
David B. Leake, David C. Wilson
AAAI
1992
15 years 7 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
ANOR
2006
133views more  ANOR 2006»
15 years 6 months ago
Horizon and stages in applications of stochastic programming in finance
To solve a decision problem under uncertainty via stochastic programming means to choose or to build a suitable stochastic programming model taking into account the nature of the r...
Marida Bertocchi, Vittorio Moriggia, Jitka Dupacov...
INFORMS
2000
128views more  INFORMS 2000»
15 years 6 months ago
A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
David G. Humphrey, James R. Wilson
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 6 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow