Sciweavers

25 search results - page 3 / 5
» Can Dataflow Subsume von Neumann Computing
Sort
View
AAAI
2007
13 years 8 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
ICPR
2008
IEEE
14 years 20 days ago
Alternative similarity functions for graph kernels
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...
Jérôme Kunegis, Andreas Lommatzsch, C...
TARK
2007
Springer
14 years 11 days ago
The computational complexity of choice sets
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
CC
2010
Springer
118views System Software» more  CC 2010»
13 years 4 months ago
Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values
Abstract. We introduce the concept of future values. Using future values it is possible to represent programs in a new control-flow form such that on any control flow path the data...
Shuhan Ding, Soner Önder
EMSOFT
2011
Springer
12 years 6 months ago
Model-checking behavioral programs
System specifications are often structured as collections of scenarios and use-cases that describe desired and forbidden sequences of events. A recently proposed behavioral progr...
David Harel, Robby Lampert, Assaf Marron, Gera Wei...