Results 1  10
of
68,758
AverageTime Games
 FSTTCS 2008
, 2008
"... ABSTRACT. An averagetime game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to minimize the average time per transition and playe ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
ABSTRACT. An averagetime game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to minimize the average time per transition
On Average Time Hierarchies
 Information Processing Letters
, 1997
"... For a timeconstructible function T we give an explicit language L T which can be recognized in time T (n). We prove that any Turing machine that recognizes L T requires time close to T (n) for most inputs, thus forming an average time hierarchy. The existence of the average time hierarchy was kn ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
For a timeconstructible function T we give an explicit language L T which can be recognized in time T (n). We prove that any Turing machine that recognizes L T requires time close to T (n) for most inputs, thus forming an average time hierarchy. The existence of the average time hierarchy
Average Time Complexity Classes
, 1995
"... We extend Levin's theory of average polynomial time to arbitrary time bounds and prove that average time complexity classes form as fine a hierarchy as do deterministic time complexity classes. Keywords: computational complexity, average time complexity classes, hierarchy, AverageP, logarithm ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We extend Levin's theory of average polynomial time to arbitrary time bounds and prove that average time complexity classes form as fine a hierarchy as do deterministic time complexity classes. Keywords: computational complexity, average time complexity classes, hierarchy, Average
Drift analysis and average time complexity of evolutionary algorithms
 Artificial Intelligence
, 2001
"... The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including cond ..."
Abstract

Cited by 107 (33 self)
 Add to MetaCart
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including
Illiquidity and stock returns: crosssection and timeseries effects,
 Journal of Financial Markets
, 2002
"... Abstract This paper shows that over time, expected market illiquidity positively affects ex ante stock excess return, suggesting that expected stock excess return partly represents an illiquidity premium. This complements the crosssectional positive returnilliquidity relationship. Also, stock ret ..."
Abstract

Cited by 864 (9 self)
 Add to MetaCart
returns are negatively related over time to contemporaneous unexpected illiquidity. The illiquidity measure here is the average across stocks of the daily ratio of absolute stock return to dollar volume, which is easily obtained from daily stock data for long time series in most stock markets. Illiquidity
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or
Distributed spacetimecoded protocols for exploiting cooperative diversity in wireless networks
 IEEE TRANS. INF. THEORY
, 2003
"... We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a m ..."
Abstract

Cited by 622 (5 self)
 Add to MetaCart
We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a
Minimum Average Time Broadcast Graphs
"... We initiate the study of minimum average time broadcast graphs  those graphs on n vertices with the fewest edges in which every vertex can broadcast in minimum average time. We find minimum average time broadcast graphs for all even n and for more than half of all odd n. In addition, we give som ..."
Abstract
 Add to MetaCart
We initiate the study of minimum average time broadcast graphs  those graphs on n vertices with the fewest edges in which every vertex can broadcast in minimum average time. We find minimum average time broadcast graphs for all even n and for more than half of all odd n. In addition, we give
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 541 (48 self)
 Add to MetaCart
, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should
Results 1  10
of
68,758