Results 1  10
of
1,791,000
Hard Times
"... With remarkable speed, through 2008, damage from the subprime mortgage crisis in the United States spread from “Wall Street ” to “Main Street. ” A sharp economic downturn whose early symptoms became apparent with the collapse, merger, or government acquisition of a string of major US banks and insur ..."
Abstract
 Add to MetaCart
communities. Some effects are already apparent; other consequences will in time become obvious. Confronted with frozen credit markets, plummeting
Healthy living in hard times
 Journal of Health Economics
, 2005
"... Using microdata on adults from the 19872000 years of the Behavioral Risk Factor Surveillance System, I show that smoking and heightadjusted weight decline during temporary economic downturns while leisuretime physical activity rises. The drop in tobacco use occurs disproportionately among heavy s ..."
Abstract

Cited by 89 (6 self)
 Add to MetaCart
Using microdata on adults from the 19872000 years of the Behavioral Risk Factor Surveillance System, I show that smoking and heightadjusted weight decline during temporary economic downturns while leisuretime physical activity rises. The drop in tobacco use occurs disproportionately among heavy
Hard times in the city – at
"... Hard times in the city – attractive nest sites but insufficient food supply lead to low reproduction rates in a bird of prey Sumasgutner et al. ..."
Abstract
 Add to MetaCart
Hard times in the city – attractive nest sites but insufficient food supply lead to low reproduction rates in a bird of prey Sumasgutner et al.
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
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 822 (39 self)
 Add to MetaCart
in the proof (though this number is a very slowly growing function of the input length). As a consequence we prove that no MAX SNPhard problem has a polynomial time approximation scheme, unless NP=P. The class MAX SNP was defined by Papadimitriou and Yannakakis [82] and hard problems for this class include
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3712 (2 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
Time Discounting and Time Preference: A Critical Review
 Journal of Economic Literature
, 2002
"... www.people.cornell.edu/pages/edo1/. ..."
The Presidential Rhetoric of Hard Times
, 2010
"... This Conference Proceeding is brought to you for free and open access by the Faculty Scholarship at Dominican Scholar. It has been accepted for ..."
Abstract
 Add to MetaCart
This Conference Proceeding is brought to you for free and open access by the Faculty Scholarship at Dominican Scholar. It has been accepted for
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis
Results 1  10
of
1,791,000