Results 1  10
of
702,328
Optimal Bounds on ThetaGraphs: More is not Always Better
"... We present tight upper and lower bounds on the spanning ratio of a large family of θgraphs. We show that θgraphs with 4k+2 cones (k ≥ 1 and integer) have a spanning ratio of 1 + 2 sin(θ/2), where θ is 2π/(4k + 2). We also show that θgraphs with 4k + 4 cones have spanning ratio at least 1 + 2 tan( ..."
Abstract
 Add to MetaCart
We present tight upper and lower bounds on the spanning ratio of a large family of θgraphs. We show that θgraphs with 4k+2 cones (k ≥ 1 and integer) have a spanning ratio of 1 + 2 sin(θ/2), where θ is 2π/(4k + 2). We also show that θgraphs with 4k + 4 cones have spanning ratio at least 1 + 2 tan
Tight regulation, modulation, and highlevel expression by vectors containing the arabinose PBAD promoter
 J
, 1995
"... PBAD promoter. arabinoseexpression by vectors containing the Tight regulation, modulation, and highlevel ..."
Abstract

Cited by 858 (14 self)
 Add to MetaCart
PBAD promoter. arabinoseexpression by vectors containing the Tight regulation, modulation, and highlevel
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Toward an instance theory of automatization
 Psychological Review
, 1988
"... This article presents a theory in which automatization is construed as the acquisition of a domainspecific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur ..."
Abstract

Cited by 613 (37 self)
 Add to MetaCart
up and predicts a powerfunction reduction in the standard deviation that is constrained to have the same exponent as the power function for the speedup. The theory accounts for qualitative properties as well, explaining how some may disappear and others appear with practice. More generally, it provides
Toward a model of text comprehension and production
 Psychological Review
, 1978
"... The semantic structure of texts can be described both at the local microlevel and at a more global macrolevel. A model for text comprehension based on this notion accounts for the formation of a coherent semantic text base in terms of a cyclical process constrained by limitations of working memory. ..."
Abstract

Cited by 540 (12 self)
 Add to MetaCart
The semantic structure of texts can be described both at the local microlevel and at a more global macrolevel. A model for text comprehension based on this notion accounts for the formation of a coherent semantic text base in terms of a cyclical process constrained by limitations of working memory
Sumpaintability of generalized thetagraphs
, 2013
"... In online list coloring (introduced by Zhu and by Schauz in 2009), on each round the set of vertices having a particular color in their lists is revealed, and the coloring algorithm chooses an independent subset of this set to receive that color. A graph G is fpaintable for a function f: V (G) → N ..."
Abstract
 Add to MetaCart
(Hi)) − (k − 1) when H1,...,Hk are the blocks of G. Also, adding an ear of length ℓ to G adds 2ℓ − 1 to the sumpaintability, when ℓ ≥ 3. Strengthening a result of Berliner et al., we prove χsp(K2,r) = 2r+min{l+m: lm> r}. The generalized thetagraph Θℓ1,...,ℓk consists of two vertices joined
A Perspective on Psychology and Economics
, 2001
"... This essay provides a perspective on the trend towards integrating psychology into economics. Some topics are discussed, and arguments are provided for why movement towards greater psychological realism in economics will improve mainstream economics. ..."
Abstract

Cited by 756 (10 self)
 Add to MetaCart
This essay provides a perspective on the trend towards integrating psychology into economics. Some topics are discussed, and arguments are provided for why movement towards greater psychological realism in economics will improve mainstream economics.
DISTRIBUTED SYSTEMS
, 1985
"... Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence. ..."
Abstract

Cited by 755 (1 self)
 Add to MetaCart
Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence.
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
& Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. In addition, it produces counterexamples of minimal length. We introduce a bounded model checking procedure for LTL
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
Results 1  10
of
702,328