Results 1  10
of
327
Halfa century of research on the Stroop effect: An integrative review
 PsychologicalBulletin
, 1991
"... The literature on interference in the Stroop ColorWord Task, covering over 50 years and some 400 studies, is organized and reviewed. In so doing, a set ofl 8 reliable empirical findings is isolated that must be captured by any successful theory of the Stroop effect. Existing theoretical positions a ..."
Abstract

Cited by 666 (14 self)
 Add to MetaCart
are summarized and evaluated in view of this critical evidence and the 2 major candidate theoriesrelative speed of processing and automaticity of readingare found to be wanting. It is concluded that recent theories placing the explanatory weight on parallel processing of the irrelevant and the relevant
Weight Reduction Problems with Bottleneck Objective
, 2001
"... This paper is concerned with bottleneck weight reduction problems stated as follows. We are given a finite set E, a class F of nonempty subsets of E, a weight w: E ! R and a cost c: E ! R . For each e 2 E; c(e) stands for the cost of reducing weight w(e) by one unit. For each subset F 2 F , ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is concerned with bottleneck weight reduction problems stated as follows. We are given a finite set E, a class F of nonempty subsets of E, a weight w: E ! R and a cost c: E ! R . For each e 2 E; c(e) stands for the cost of reducing weight w(e) by one unit. For each subset F 2 F
AllPairs Bottleneck Paths in Vertex Weighted Graphs
 In Proc. of SODA, 978–985
, 2007
"... Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v), ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v
Upgrading Bottleneck Constrained Forests
, 1998
"... We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each link emanating from v. The goal is to find a minimum cost set of nodes to be upgraded so that the ..."
Abstract
 Add to MetaCart
We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each link emanating from v. The goal is to find a minimum cost set of nodes to be upgraded so
Locating Internet Bottlenecks: Algorithms, Measurements, and Implications
 In Proc. of ACM SIGCOMM ’04
, 2004
"... The views and conclusions contained in this document are those of the authors and should not be interpreted as The ability to locate network bottlenecks along endtoend paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottleneck links ..."
Abstract

Cited by 81 (7 self)
 Add to MetaCart
packets. These drawbacks make them impractical. In this paper, we present a novel lightweight, singleend active probing tool – Pathneck – based a novel probing technique called Recursive Packet Train (RPT), which allows end users to efficiently and accurately locate bottleneck points to destinations
Bottleneck Domination and Bottleneck Independent Domination on Graphs
, 2002
"... In this paper, the bottleneck dominating set problem and one of its variants, the bottleneck independent dominating set problem, are considered. Let G(V, E, W) denote a graph with nvertexset V and medgeset E, where each vertex v is associated with a real cost W(v). Given any subset V ′ of V, the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
on weighted general graphs using the binary search technique. Second, an O(n) time algorithm is designed for the problem on weighted trees. Then, we show that the situation is greatly different when the Bottleneck Independent Dominating Set problem (the BIDS problem) is considered. This paper proves
A Graph Bottleneck Inequality
, 2008
"... For a weighted directed multigraph, let fij be the total weight of spanning converging forests that have vertex i in a tree converging to j. We prove that fij fjk = fik fjj if and only if every directed path from i to k contains j (a graph bottleneck equality). Otherwise, fij fjk < fik fjj (a gra ..."
Abstract
 Add to MetaCart
For a weighted directed multigraph, let fij be the total weight of spanning converging forests that have vertex i in a tree converging to j. We prove that fij fjk = fik fjj if and only if every directed path from i to k contains j (a graph bottleneck equality). Otherwise, fij fjk < fik fjj (a
An assessment of the bottlenecks and of European initiatives (*)
"... Abstract: The article investigates the takeup of ICT by SMEs with less than 10 employees, i.e. microenterprises. Despite their economic weight in European economy and their significance within a more flexible network economy, these very small businesses are to a large extent underexposed in resear ..."
Abstract
 Add to MetaCart
Abstract: The article investigates the takeup of ICT by SMEs with less than 10 employees, i.e. microenterprises. Despite their economic weight in European economy and their significance within a more flexible network economy, these very small businesses are to a large extent underexposed
Online Bottleneck Matching
"... Abstract. We consider the online bottleneck matching problem, where k serververtices lie in a metric space and k requestvertices that arrive over time each must immediately be permanently assigned to a serververtex. The goal is to minimize the maximum distance between any request and its server. ..."
Abstract
 Add to MetaCart
Abstract. We consider the online bottleneck matching problem, where k serververtices lie in a metric space and k requestvertices that arrive over time each must immediately be permanently assigned to a serververtex. The goal is to minimize the maximum distance between any request and its server
Multipath Congestion Control for Shared Bottleneck
"... Multipath transport protocols, which transmit data over multiple distinct paths in an endtoend connection are introduced. However, they have a problem in terms of fairness. When the transmissions along several paths share the same bottleneck link, the multipath connection receives higher throughpu ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Multipath transport protocols, which transmit data over multiple distinct paths in an endtoend connection are introduced. However, they have a problem in terms of fairness. When the transmissions along several paths share the same bottleneck link, the multipath connection receives higher
Results 1  10
of
327