Sciweavers

4137 search results - page 678 / 828
» On the number of matchings of a tree
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...
VTC
2007
IEEE
125views Communications» more  VTC 2007»
14 years 2 months ago
Joint Source Coding, Unity Rate Precoding and FFH-MFSK Modulation Using Iteratively Decoded Irregular Variable Length Coding
— Serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Fast Frequency Hopping (FFH) M-ary Frequency Shift Keying (MFSK) i...
Sohail Ahmed, Robert G. Maunder, Lie-Liang Yang, S...
AUSDM
2007
Springer
100views Data Mining» more  AUSDM 2007»
14 years 2 months ago
Predictive Model of Insolvency Risk for Australian Corporations
This paper describes the development of a predictive model for corporate insolvency risk in Australia. The model building methodology is empirical with out-ofsample future year te...
Rohan A. Baxter, Mark Gawler, Russell Ang
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 2 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
COLT
2007
Springer
14 years 2 months ago
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
Peter Auer, Ronald Ortner, Csaba Szepesvári