Sciweavers

1204 search results - page 160 / 241
» Termination of Polynomial Programs
Sort
View
AMAI
2006
Springer
15 years 6 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
SIMPRA
2008
99views more  SIMPRA 2008»
15 years 6 months ago
Response surface methodology for constrained simulation optimization: An overview
This article summarizes `Generalized Response Surface Methodology'(GRSM), extending Box and Wilson's `Response Surface Methodology'(RSM). GRSM allows multiple rando...
Jack P. C. Kleijnen
EC
2008
153views ECommerce» more  EC 2008»
15 years 5 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
COCOA
2010
Springer
15 years 4 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
COMMA
2010
15 years 1 months ago
A characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
Teresa Alsinet, Ramón Béjar, Lluis G...