Sciweavers

1941 search results - page 234 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
ATAL
2005
Springer
15 years 3 months ago
How local is that optimum? k-optimality for DCOP
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Ta...
76
Voted
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 8 months ago
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
I-Hong Hou, P. R. Kumar
85
Voted
WWW
2005
ACM
15 years 11 months ago
Boosting SVM classifiers by ensemble
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...
Yan-Shi Dong, Ke-Song Han
96
Voted
AUTOMATICA
2010
127views more  AUTOMATICA 2010»
14 years 8 months ago
Partitioning datasets based on equalities among parameters
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
Riccardo Porreca, Giancarlo Ferrari-Trecate
110
Voted
ICISC
2000
126views Cryptology» more  ICISC 2000»
14 years 11 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...