Sciweavers

364 search results - page 3 / 73
» Generalized normal forms and polynomial system solving
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
SOCO
2002
Springer
13 years 5 months ago
Fuzzy relation equations (I): the general and specialized solving algorithms
In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathema...
Li Chen, Paul P. Wang
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 7 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
ACISP
2010
Springer
13 years 7 months ago
Solving Generalized Small Inverse Problems
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
Noboru Kunihiro
ACTA
2007
92views more  ACTA 2007»
13 years 5 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider