Sciweavers

1219 search results - page 77 / 244
» Where to Look Next
Sort
View
ECCC
2006
71views more  ECCC 2006»
13 years 9 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
EOR
2006
66views more  EOR 2006»
13 years 9 months ago
Multi-period capacity expansion for a local access telecommunications network
In this paper, we examine a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. Capacity expansion is realized through the ...
Michel Gendreau, Jean-Yves Potvin, Ali Smires, Pat...
INFFUS
2006
104views more  INFFUS 2006»
13 years 9 months ago
Reasoning with multiple-source information in a possibilistic logic framework
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...
Salem Benferhat, Claudio Sossai
INFORMATICALT
2007
111views more  INFORMATICALT 2007»
13 years 9 months ago
Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...
Jurate Sakalauskaite
JCSS
2007
88views more  JCSS 2007»
13 years 9 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles