Sciweavers

2976 search results - page 445 / 596
» On the bounded integer programming
Sort
View
IOR
2007
82views more  IOR 2007»
13 years 10 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
JCO
2010
97views more  JCO 2010»
13 years 8 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
KI
2011
Springer
13 years 5 months ago
Centurio, a General Game Player: Parallel, Java- and ASP-based
Abstract We present the General Game Playing system Centurio. Centurio is a Java-based player featuring different strategies based on Monte Carlo Tree Search extended by technique...
Maximilian Möller, Marius Thomas Schneider, M...
TCS
2011
13 years 5 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ICALP
2011
Springer
13 years 1 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden