Sciweavers

11328 search results - page 43 / 2266
» Timed Branching Processes
Sort
View
SPATIALCOGNITION
2000
Springer
15 years 5 months ago
Schematic Maps as Wayfinding Aids
Schematic maps are effective tools for representing information e physical environment; they depict specific information in an abstract way. This study concentrates on spatial aspe...
Hernan Casakin, Thomas Barkowsky, Alexander Klippe...
LAWEB
2005
IEEE
15 years 7 months ago
Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan
ASIAN
2005
Springer
96views Algorithms» more  ASIAN 2005»
15 years 7 months ago
Query Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan
TAMC
2009
Springer
15 years 8 months ago
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
Jasper Berendsen, Taolue Chen, David N. Jansen
WCET
2008
15 years 3 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti