3 citations · 3 across the 6 of their papers we have counts for
8 papers
A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic Assignment
Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Sadok Ben Yahia +1
This paper presents a new simulation-based approach to address the stochastic Dynamic Traffic Assignment (DTA) problem, focusing on large congested networks and dynamic settings. T…
Exploring Machine Learning Techniques to Identify Important Factors Leading to Injury in Curve Related Crashes
Mehdi Moeinaddini, Mozhgan Pourmoradnasseri, Amnir Hadachi +1
Different factors have effects on traffic crashes and crash-related injuries. These factors include segment characteristics, crash-level characteristics, occupant level characteris…
Real-Time Calibration of Disaggregated Traffic Demand
Mozhgan Pourmoradnasseri, Kaveh Khoshkhah, Amnir Hadachi
This paper presents a simulation-based optimization framework for city-scale real-time estimation and calibration of dynamic demand models by focusing on disaggregated microsimulat…
Nondeterministic Communication Complexity of Random Boolean Functions
Mozhgan Pourmoradnasseri, Dirk Oliver Theis
We study nondeterministic communication complexity and related concepts (fooling sets, fractional covering number) of random functions where each va…
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis
Graphs (1-skeletons) of Traveling-Salesman-related polytopes have attracted a lot of attention. Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Prob…
On the Graph of the Pedigree Polytope
Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis
Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Problem polytopes whose graphs (1-skeletons) contain the TSP polytope graphs as spanning subgraphs.…
The (minimum) rank of typical fooling set matrices
Mozhgan Pourmoradnasseri, Dirk Oliver Theis
A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at…
Short note on the number of 1-ascents in dispersed dyck paths
Kairi Kangro, Mozhgan Pourmoradnasseri, Dirk Oliver Theis
A dispersed Dyck path (DDP) of length n is a lattice path on from (0,0) to (n,0) in which the following steps are allowed: "up" (x, y) (x+1, y+1); "down" (x, y) $…