Results 1  10
of
134,922
NonModelBased Algorithm Portfolios for SAT
"... When tackling a computationally challenging combinatorial problem, one often observes that some solution approaches work well on some instances, while other approaches work better on other instances. This observation has given rise to the idea of building algorithm portfolios [5]. LeytonBrown et al ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Competitions [6]. We investigate alternate ways of building algorithm portfolios that differ substantially from the way SATzilla assembles a portfolio. The key idea behind SATzilla is to train a runtime prediction model for each constituent solver, based on a number of wellengineered features of SAT instances
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
A new learning algorithm for blind signal separation

, 1996
"... A new online learning algorithm which minimizes a statistical dependency among outputs is derived for blind separation of mixed signals. The dependency is measured by the average mutual information (MI) of the outputs. The source signals and the mixing matrix are unknown except for the number of ..."
Abstract

Cited by 614 (80 self)
 Add to MetaCart
network like model. The validity of the new learning algorithm are verified by computer simulations.
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Understanding and using the Implicit Association Test: I. An improved scoring algorithm
 Journal of Personality and Social Psychology
, 2003
"... behavior relations Greenwald et al. Predictive validity of the IAT (Draft of 30 Dec 2008) 2 Abstract (131 words) This review of 122 research reports (184 independent samples, 14,900 subjects), found average r=.274 for prediction of behavioral, judgment, and physiological measures by Implic ..."
Abstract

Cited by 592 (92 self)
 Add to MetaCart
behavior relations Greenwald et al. Predictive validity of the IAT (Draft of 30 Dec 2008) 2 Abstract (131 words) This review of 122 research reports (184 independent samples, 14,900 subjects), found average r=.274 for prediction of behavioral, judgment, and physiological measures by Implicit Association Test (IAT) measures. Parallel explicit (i.e., selfreport) measures, available in 156 of these samples (13,068 subjects), also predicted effectively (average r=.361), but with much greater variability of effect size. Predictive validity of selfreport was impaired for socially sensitive topics, for which impression management may distort selfreport responses. For 32 samples with criterion measures involving Blackâ€“White interracial behavior, predictive validity of IAT measures significantly exceeded that of selfreport measures. Both IAT and selfreport measures displayed incremental validity, with each measure predicting criterion variance beyond that predicted by the other. The more highly IAT and selfreport measures were intercorrelated, the greater was the predictive validity of each.
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Detecting LongRun Abnormal Stock Returns: The Empirical Power and Specification of Test Statistics
 Journal of Financial Economics
, 1997
"... We analyze the empirical power and specification of test statistics in event studies designed to detect longrun (one to fiveyear) abnormal stock returns. We document that test statistics based on abnormal returns calculated using a reference portfolio, such as a market index, are misspecified (em ..."
Abstract

Cited by 517 (7 self)
 Add to MetaCart
We analyze the empirical power and specification of test statistics in event studies designed to detect longrun (one to fiveyear) abnormal stock returns. We document that test statistics based on abnormal returns calculated using a reference portfolio, such as a market index, are misspecified
Empirical exchange rate models of the Seventies: do they fit out of sample?
 JOURNAL OF INTERNATIONAL ECONOMICS
, 1983
"... This study compares the outofsample forecasting accuracy of various structural and time series exchange rate models. We find that a random walk model performs as well as any estimated model at one to twelve month horizons for the dollar/pound, dollar/mark, dollar/yen and tradeweighted dollar exch ..."
Abstract

Cited by 831 (12 self)
 Add to MetaCart
exchange rates. The candidate structural models include the flexibleprice (FrenkelBilson) and stickyprice (DornbuschFrankel) monetary models, and a stickyprice model which incorporates the current account (HooperMorton). The structural models perform poorly despite the fact that we base
Coherent Measures of Risk
, 1998
"... In this paper we study both market risks and nonmarket risks, without complete markets assumption, and discuss methods of measurement of these risks. We present and justify a set of four desirable properties for measures of risk, and call the measures satisfying these properties "coherent" ..."
Abstract

Cited by 882 (4 self)
 Add to MetaCart
In this paper we study both market risks and nonmarket risks, without complete markets assumption, and discuss methods of measurement of these risks. We present and justify a set of four desirable properties for measures of risk, and call the measures satisfying these properties "
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Results 1  10
of
134,922