Sciweavers

8512 search results - page 320 / 1703
» Computing Theory With Relevance
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Computational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
RTA
2010
Springer
15 years 10 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
IACR
2011
127views more  IACR 2011»
14 years 6 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky

Lecture Notes
742views
17 years 4 months ago
Computer Systems Analysis
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
Raj Jain
GECCO
2004
Springer
175views Optimization» more  GECCO 2004»
16 years 2 days ago
Enhanced Innovation: A Fusion of Chance Discovery and Evolutionary Computation to Foster Creative Processes and Decision Making
Abstract. Human-based genetic algorithms are powerful tools for organizational modeling. If we enhance them using chance discovery techniques, we obtain an innovative approach for ...
Xavier Llorà, Kei Ohnishi, Ying-Ping Chen, ...