Sciweavers

4171 search results - page 57 / 835
» Choice numbers of graphs
Sort
View
IEEECIT
2005
IEEE
15 years 5 months ago
Interactive Web Service Choice-Making Based on Extended QoS Model
: Quality of Service (QoS) is a key factor in Web service advertising, choosing and runtime monitoring. Web service QoS is multi-faceted, fuzzy and dynamic. Current researches focu...
Yujie Mou, Jian Cao, Shen-sheng Zhang, Jianhong Zh...
MANSCI
2006
119views more  MANSCI 2006»
14 years 11 months ago
Supply Chain Choice on the Internet
Internet companies extensively use the practice of drop-shipping, where the wholesaler stocks and owns the inventory and ships products directly to customers at retailers' re...
Serguei Netessine, Nils Rudi
FPGA
2004
ACM
234views FPGA» more  FPGA 2004»
15 years 3 months ago
An embedded true random number generator for FPGAs
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
Paul Kohlbrenner, Kris Gaj
WSC
2008
15 years 2 months ago
Comparing two systems: Beyond common random numbers
Suppose one wishes to compare two closely related systems via stochastic simulation. Common random numbers (CRN) involves using the same streams of uniform random variates as inpu...
Samuel Ehrlichman, Shane G. Henderson
CC
1998
Springer
111views System Software» more  CC 1998»
14 years 11 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson