14165 search results - page 549 / 2833 » The generalized two-server problem |
215
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
184
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
198
click to vote
JAIR
2008
15 years 7 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
181
Voted
DAM
2007
15 years 7 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
169
click to vote
ANOR
2005
15 years 7 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...