Sciweavers

1139 search results - page 138 / 228
» Bounded Ideation Theory
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
A Network Calculus Approach to Probabilistic Quality of Service Analysis of Fading Channels
Abstract— Network calculus is an established theory for deterministic quality of service analysis of fixed networks. Due to the failures inherent in fading channels it is, howev...
Markus Fidler
SAC
2006
ACM
14 years 1 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
SIGECOM
2005
ACM
109views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Cost sharing in a job scheduling problem using the Shapley value
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...
Debasis Mishra, Bharath Rangarajan
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
COLT
2005
Springer
14 years 1 months ago
Ranking and Scoring Using Empirical Risk Minimization
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
Stéphan Clémençon, Gáb...