Sciweavers

894 search results - page 73 / 179
» Game Theory with Costly Computation
Sort
View
113
Voted
JCIT
2007
107views more  JCIT 2007»
15 years 1 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 2 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
TASE
2008
IEEE
15 years 1 months ago
Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
Dinesh Garg, Y. Narahari
LICS
2009
IEEE
15 years 8 months ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram
113
Voted
SOCO
2008
Springer
15 years 1 months ago
Tabu search for attribute reduction in rough set theory
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
Abdel-Rahman Hedar, Jue Wang, Masao Fukushima