Sciweavers

1242 search results - page 23 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
66
Voted
IPPS
2007
IEEE
15 years 4 months ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...
77
Voted
EOR
2007
102views more  EOR 2007»
14 years 9 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
CICLING
2005
Springer
15 years 3 months ago
A Computational Model of the Spanish Clitic System
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
Luis Alberto Pineda, Ivan V. Meza
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
CICLING
2003
Springer
15 years 2 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen