Sciweavers

1034 search results - page 178 / 207
» Competitive generalized auctions
Sort
View
EXPCS
2007
14 years 1 months ago
Introducing entropies for representing program behavior and branch predictor performance
Predictors are inherent components of state-of-the-art microprocessors. Branch predictors are discussed actively from diverse perspectives. Performance of a branch predictor large...
Takashi Yokota, Kanemitsu Ootsu, Takanobu Baba
HPDC
2007
IEEE
14 years 1 months ago
MOB: zero-configuration high-throughput multicasting for grid applications
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
Mathijs den Burger, Thilo Kielmann
CIKM
2006
Springer
14 years 26 days ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...
CLEF
2008
Springer
13 years 11 months ago
ParaMor and Morpho Challenge 2008
ParaMor, our unsupervised morphology induction system performed well at Morpho Challenge 2008. When ParaMor's morphological analyses, which specialize at identifying inflecti...
Christian Monson, Jaime G. Carbonell, Alon Lavie, ...
CPAIOR
2008
Springer
13 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann