Sciweavers

3680 search results - page 403 / 736
» cases 2010
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 5 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
JAPLL
2010
98views more  JAPLL 2010»
15 years 5 months ago
Formalization of the ad hominem argumentation scheme
In this paper, several examples from the literature, and one central new one, are used as case studies of texts of discourse containing an argumentation scheme that has now been w...
Douglas Walton
ENTCS
2007
178views more  ENTCS 2007»
15 years 6 months ago
Recent Advances in Real-Time Maude
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
Peter Csaba Ölveczky, José Meseguer
ICWE
2010
Springer
15 years 11 months ago
A Visual Tool for Rapid Integration of Enterprise Software Applications
: © A visual tool for rapid integration of enterprise software applications Inbal Marhaim, Eli Mordechai, Claudio Bartolini, Ruth Bergman, Oren Ariel, Christopher Peltz HP Laborat...
Inbal Marhaim, Eli Mordechai, Claudio Bartolini, R...
ECCC
2010
117views more  ECCC 2010»
15 years 5 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...