Sciweavers

844 search results - page 72 / 169
» Solving the p
Sort
View
ICCSA
2007
Springer
15 years 7 months ago
Supplier Selection for a Newsboy Model with Budget and Service Level Constraints
A style dress outlet usually purchases products from multiple suppliers with different cost, quality and selling price. It is assumed that some suppliers will sell their goods to t...
P. C. Yang, H. M. Wee, Erwie Zahara, S. H. Kang, Y...
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
15 years 15 days ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
JCSS
2006
63views more  JCSS 2006»
15 years 5 months ago
Error-bounded probabilistic computations between MA and AM
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
Elmar Böhler, Christian Glaßer, Daniel ...
WWW
2004
ACM
16 years 6 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau
159
Voted
PODS
2005
ACM
124views Database» more  PODS 2005»
16 years 5 months ago
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
Serge Abiteboul, Stefan Haar, Tova Milo, Zoë ...