Sciweavers

2905 search results - page 375 / 581
» Formal Memetic Algorithms
Sort
View
STACS
1993
Springer
15 years 8 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
ATAL
2008
Springer
15 years 6 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...
192
Voted
FMSB
2008
199views Formal Methods» more  FMSB 2008»
15 years 5 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...
141
Voted
FORMATS
2008
Springer
15 years 5 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 4 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart