Sciweavers

1546 search results - page 75 / 310
» Thoughts on solution concepts
Sort
View
CCO
2001
Springer
157views Combinatorics» more  CCO 2001»
14 years 1 months ago
Lagrangian Relaxation
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
Claude Lemaréchal
QCQC
1998
Springer
121views Communications» more  QCQC 1998»
14 years 1 months ago
What Information Theory Can Tell Us About Quantum Reality
Abstract. An investigation of Einstein's "physical" reality and the concept of quantum reality in terms of information theory suggests a solution to quantum paradoxe...
Christoph Adami, Nicolas J. Cerf
ATAL
2008
Springer
13 years 11 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
IJIT
2004
13 years 10 months ago
Synthesis of Logic Circuits Using Fractional-Order Dynamic Fitness Functions
This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuit...
Cecília Reis, José António Te...
EOR
2008
125views more  EOR 2008»
13 years 9 months ago
Shapley mappings and the cumulative value for n-person games with fuzzy coalitions
In this paper we prove the existence and uniqueness of a solution concept for n-person games with fuzzy coalitions, which we call the Shapley mapping. The Shapley mapping, when it...
Dan Butnariu, Tomás Kroupa