2027 search results - page 129 / 406 » Approximating power indices |
147
click to vote
JGO
2008
15 years 6 months ago
2008
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
158
click to vote
SIGDIAL
2010
15 years 1 months ago
2010
We perform a study of existing dialogue corpora to establish the theoretical maximum performance of the selection approach to simulating human dialogue behavior in unseen dialogue...
172
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
148
click to vote
ISCC
2008
IEEE
16 years 23 days ago
2008
IEEE
The present paper presents a Markov Chain model of polling in noisy multi-hop systems typical of Power Line Communications (PLC) as well as of other systems. The model includes the...
167
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...