Sciweavers

1439 search results - page 121 / 288
» Fast approximation of centrality
Sort
View
IOR
2010
114views more  IOR 2010»
14 years 11 months ago
Inventory Management of a Fast-Fashion Retail Network
Working in collaboration with Spain-based retailer Zara, we address the problem of distributing over time a limited amount of inventory across all the stores in a fast-fashion ret...
Felipe Caro, Jérémie Gallien
156
Voted
ANCS
2009
ACM
14 years 10 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
130
Voted
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 3 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
ACHI
2009
IEEE
15 years 7 months ago
Model-Driven Instrumentation of Graphical User Interfaces
In today’s continuously changing markets newly developed products often do not meet the demands and expectations of customers. Research on this problem identified a large gap b...
Mathias Funk, Philip Hoyer, Stefan Link
88
Voted
WSC
1998
15 years 2 months ago
Tutorial: Simulation in the Hospitality Industry
This tutorial article addresses the use of simulation in the hospitality industry, in particular the use of simulation in the fast food restaurant industry. Although the applicati...
Darrell W. Starks, Todd C. Whyte