7055 search results - page 1107 / 1411 » Some New 4-Designs |
179
click to vote
DAM
2008
15 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
208
click to vote
DEBU
2008
15 years 7 months ago
2008
Process mining has emerged as a way to discover or check the conformance of processes based on event logs. This enables organizations to learn from processes as they really take p...
207
click to vote
EOR
2010
15 years 7 months ago
2010
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
222
click to vote
ECEASST
2008
15 years 7 months ago
2008
In emergency scenarios we can obtain a more effective coordination among team members constituting a mobile ad hoc network (MANET) through the use of reconfigurable systems. This ...
197
Voted
AMAI
2006
Springer
15 years 7 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...