Sciweavers

11740 search results - page 233 / 2348
» More Problems in Rewriting
Sort
View
PC
2010
196views Management» more  PC 2010»
15 years 5 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
CEEMAS
2005
Springer
16 years 2 days ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim
HICSS
2003
IEEE
138views Biometrics» more  HICSS 2003»
15 years 12 months ago
A Single Buyer-Single Supplier Bargaining Problem with Asymmetric Information - Theoretical Approach and Software Implementation
This paper is focused on the coordination of order and production policy between buyers and suppliers in supply chains. When a buyer and a supplier of an item work independently, ...
Eric Sucky
CHI
2011
ACM
14 years 10 months ago
No clicks, no problem: using cursor movements to understand and improve search
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
Jeff Huang, Ryen W. White, Susan T. Dumais
ICALP
2011
Springer
14 years 10 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...