8838 search results - page 411 / 1768 » Generalizing Domain Theory |
162
click to vote
IWSSD
2000
IEEE
15 years 11 months ago
2000
IEEE
A good architecture is a necessary condition to guarantee that the expected levels of performance, availability, fault tolerance, and scalability are achieved by the implemented s...
150
click to vote
ICCBR
1997
Springer
15 years 11 months ago
1997
Springer
In this paper we propose a large case-based reasoner for the legal domain. Analyzing legal texts for indexing purposes makes the implementation of large case bases a complex task. ...
178
Voted
PEPM
1994
ACM
15 years 11 months ago
1994
ACM
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
180
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
197
Voted
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...