116 search results - page 17 / 24 » Reasoning Symbolically About Partially Matched Cases |
SLP
1994
14 years 10 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
JSSPP
2004
Springer
15 years 2 months ago
2004
Springer
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
98
Voted
SLE
2009
Springer
15 years 2 months ago
2009
Springer
Composition of requirements models in Software Product Line (SPL) development enables stakeholders to derive the requirements of target software products and, very important, to re...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
100
click to vote
CSL
2006
Springer
14 years 9 months ago
2006
Springer
A novel technique for maximum "a posteriori" (MAP) adaptation of maximum entropy (MaxEnt) and maximum entropy Markov models (MEMM) is presented. The technique is applied...