Sciweavers

347 search results - page 34 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
15 years 5 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
EMSOFT
2004
Springer
15 years 5 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 5 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
RTCSA
2007
IEEE
15 years 6 months ago
Scheduling Algorithms for I/O Blockings with a Multi-frame Task Model
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada
DCC
2006
IEEE
15 years 11 months ago
Analysis of Multiple Antenna Systems with Finite-Rate Feedback Using High Resolution Quantization Theory
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
Jun Zheng, Ethan R. Duni, Bhaskar D. Rao