Sciweavers

664 search results - page 41 / 133
» Some results for a class of generalized polynomials
Sort
View
TCS
2008
14 years 9 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
WINE
2009
Springer
127views Economy» more  WINE 2009»
15 years 4 months ago
Nash Dynamics in Congestion Games with Similar Resources
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
COMPGEOM
2009
ACM
15 years 4 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
FCT
2009
Springer
15 years 4 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...