Search
Now showing items 61-70 of 976
Role of Temporal Integration and Fluctuation Detection in the Highly Irregular Firing of a Leaky Integrator Neuron Model with Partial Reset
(1997)
Partial reset is a simple and powerful tool for controlling the irregularity of spike trains fired by a leaky integrator neuron model with random inputs. In particular, a single neuron model with a realistic membrane time ...
Efficient bufferless packet switching on trees and leveled networks
(2007)
In bufferless networks the packets cannot be buffered while they are in transit
Universal bufferless packet switching
(2007)
A packet-switching algorithm specifies the actions of the nodes in order to deliver packets in the network. A packet-switching algorithm is universal if it applies to any network topology and for any batch communication ...
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 ...
A combinatorial treatment of balancing networks
(1996)
Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures ...
Investigating the relation between users' cognitive style and web navigation behavior with k-means clustering
(2012)
This paper focuses on modeling users' cognitive style based on a set of Web usage mining techniques on navigation patterns and clickstream data. Main aim is to investigate whether k-means clustering can group users of ...
Modeling users on the World Wide Web based on cognitive factors, navigation behavior and clustering techniques
(2013)
This paper focuses on modeling users' cognitive styles based on a set of Web usage mining techniques on user navigation patterns and clickstream data. Main aim is to investigate whether specific clustering techniques can ...
Complexity of rational and irrational nash equilibria
(2014)
We introduce two new natural 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 ...
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 ...
Near-optimal hot-potato routing on trees
(2004)
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems ...