Sciweavers

1220 search results - page 92 / 244
» Dependent classes
Sort
View
110
Voted
MOC
2002
118views more  MOC 2002»
15 years 10 days ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
ICST
2008
IEEE
15 years 7 months ago
Testing Consequences of Grime Buildup in Object Oriented Design Patterns
Evidence suggests that as software ages the original realizations of design patterns remain in place, and participants in design pattern realizations accumulate “grime” – no...
Clemente Izurieta, James M. Bieman
99
Voted
ICCBR
2003
Springer
15 years 5 months ago
An Investigation of Generalized Cases
In the CBR literature from the past 25 years there is a considerable amount of research work that makes use of cases that are subspaces of some representation space rather than poi...
Kerstin Maximini, Rainer Maximini, Ralph Bergmann
84
Voted
AAAI
1997
15 years 2 months ago
Applications of Rule-Base Coverage Measures to Expert System Evaluation
Often a rule-based system is tested by checking its performance on a number of test cases with known solutions, modifying the system until it gives the correct results for all or ...
Valerie Barr
SIROCCO
2008
15 years 2 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...