Search
Now showing items 11-20 of 249
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 ...
Universal bufferless routing
(2005)
Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...
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 ...
Strength of counting networks
(1996)
This paper shows that any counting network, made up of balancers whose fan-in and fan-out vary arbitrarily, is, indeed, strong enough to simultaneously support both Fetch&Increment and Fetch&Decrement operations, once each ...
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 ...
Algorithmic mechanisms for internet supercomputing 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 ...
Classification of satellite cloud imagery based on multi-feature texture analysis and neural networks
(2001)
The aim of this work was to develop a system based on modular neural networks and multi-feature texture analysis that will facilitate the automated interpretation of cloud images. This will speed up the interpretation ...