Sciweavers

1208 search results - page 1 / 242
» Uniform eventown problems
Sort
View
TCS
2008
13 years 10 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
MOC
2002
101views more  MOC 2002»
13 years 10 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu
CEC
2007
IEEE
14 years 5 months ago
An efficient Genetic Algorithm with uniform crossover for the multi-objective Airport Gate Assignment Problem
—Genetic Algorithms (GAs) have a good potential of solving the Gate Assignment Problem (GAP) at airport terminals, and the design of feasible and efficient evolutionary operators...
Xiao-Bing Hu, Ezequiel A. Di Paolo
BIRTHDAY
2008
Springer
13 years 12 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat
JDA
2007
62views more  JDA 2007»
13 years 10 months ago
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
In this paper, we deal with the maximum integer multiflow and the minimum multicut problems in rectilinear grid graphs with uniform capacities on the edges. The first problem is...
Cédric Bentz, Marie-Christine Costa, Fr&eac...