7129 search results - page 828 / 1426 » Approximation Algorithms for Treewidth |
193
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
196
click to vote
IJON
2007
15 years 6 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
136
click to vote
MOC
2000
15 years 6 months ago
2000
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
222
click to vote
TKDE
2012
13 years 8 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...