Search
Now showing items 1-10 of 112
Folk dance evaluation using laban movement analysis
(2015)
Motion capture (mocap) technology is an efficient method for digitizing art performances, and is becoming increasingly popular in the preservation and dissemination of dance performances. Although technically the captured ...
Complexity of rational and irrational Nash equilibria
(2011)
We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
The complexity of decision problems about nash equilibria in win-lose games
(2012)
We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties exist
Extended semantics and optimization algorithms for CP-networks
(2004)
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more ...
Direct routing: Algorithms and complexity
(2006)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct ...
Direct routing: Algorithms and complexity
(2004)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
A spiking neuron model: Applications and learning
(2002)
This paper presents a biologically inspired, hardware-realisable spiking neuron model, which we call the Temporal Noisy-Leaky Integrator (TNLI). The dynamic applications of the model as well as its applications in Computational ...
Algorithmic mechanisms for reliable master-worker internet-based computing
(2014)
We consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of untrusted worker processors, and collects their responses. Examples of such ...
Brief announcement: Algorithmic mechanisms for internet-based computing under unreliable communication
(2011)
This work, using a game-theoretic approach, considers Internet-based computations, where a master processor assigns, over the Internet, a computational task to a set of untrusted worker processors, and collects their ...
Applying the dynamics of evolution to achieve reliability in master-worker computing
(2013)
We consider Internet-based master-worker task computations, such as SETI@home, where a master process sends tasks, across the Internet, to worker processes