Sciweavers

5964 search results - page 189 / 1193
» A theory of speculative computation
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 5 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
188
Voted
CAP
2010
15 years 2 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 7 months ago
On CSP and the Algebraic Theory of Effects
We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors and effect deconstructors; it also provides a link wit...
Rob J. van Glabbeek, Gordon D. Plotkin
APN
2007
Springer
16 years 1 months ago
Petri Nets, Discrete Physics, and Distributed Quantum Computation
We shall describe connections between Petri nets, quantum physics and category theory. The view of Net theory as a kind of discrete physics has been consistently emphasized by Carl...
Samson Abramsky
GECCO
2003
Springer
16 years 8 days ago
Effective Use of Directional Information in Multi-objective Evolutionary Computation
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...
Martin Brown, Robert E. Smith