MST
2010
13 years 1 months ago
2010
MST
2010
13 years 1 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
MST
2010
13 years 1 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
MSS
2010
IEEE
13 years 1 months ago
2010
IEEE
MSS
2010
IEEE
13 years 1 months ago
2010
IEEE
This note derives the Golden Rule of capital accumulation in a Chakrabortytype economy, i.e. a two-period OLG economy where longevity is endogenous. It is shown that the capital p...
MSS
2010
IEEE
13 years 1 months ago
2010
IEEE
Abstract We study the structure of unstable local effectivity functions defined for n players and p alternatives. A stability index based on the notion of cycle is introduced. In t...
MSS
2010
IEEE
13 years 1 months ago
2010
IEEE
MSS
2010
IEEE
13 years 1 months ago
2010
IEEE
Following Stollery[1998], we extend the Solow, Dasgupta-Heal model to analyze the e
MSS
2010
IEEE
13 years 1 months ago
2010
IEEE
MICRO
2010
IEEE
13 years 1 months ago
2010
IEEE
Since the non-cache parts of a core are less regular, compared to on-chip caches, tolerating manufacturing defects in the processing core is a more challenging problem. Due to the ...