515 search results - page 21 / 103 » Towards a computational transportation science |
HICSS
2007
IEEE
14 years 2 months ago
2007
IEEE
The deregulated electricity market calls for robust OPF tools that can provide (a) deterministic convergence, (b) accurate computation of a variety of nodal prices, (c) support of...
ASUNAM
2011
IEEE
12 years 8 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
GI
2005
Springer
14 years 2 months ago
2005
Springer
: In order to reduce transmission cost mobile information system clients often cache data retrieved in a context aware manner. In the case of updates it may happen that this data b...
GI
2004
Springer
14 years 1 months ago
2004
Springer
: This paper introduces a flexible and reconfigurable protocol stack framework containing agent-based self-optimisation-capabilities for mobile terminals. The framework architectur...
FOCS
1991
IEEE
13 years 12 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean