ACM DL

Modeling and Computer Simulation (TOMACS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Modeling and Computer Simulation (TOMACS), Volume 21 Issue 3, March 2011

Stochastic approximation algorithms for constrained optimization via simulation
Shalabh Bhatnagar, N. Hemachandra, Vivek Kumar Mishra
Article No.: 15
DOI: 10.1145/1921598.1921599

We develop four algorithms for simulation-based optimization under multiple inequality constraints. Both the cost and the constraint functions are considered to be long-run averages of certain state-dependent single-stage functions. We pose the...

An analysis of a variation of hit-and-run for uniform sampling from general regions
Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky
Article No.: 16
DOI: 10.1145/1921598.1921600

Hit-and-run, a class of MCMC samplers that converges to general multivariate distributions, is known to be unique in its ability to mix fast for uniform distributions over convex bodies. In particular, its rate of convergence to a uniform...

A dynamic sort-based DDM matching algorithm for HLA applications
Ke Pan, Stephen John Turner, Wentong Cai, Zengxiang Li
Article No.: 17
DOI: 10.1145/1921598.1921601

Simulation is a low-cost and safe alternative to solve complex problems in various areas. To promote reuse and interoperability of simulation applications and link geographically dispersed simulation components, distributed simulation was...

An analysis of queuing network simulation using GPU-based hardware acceleration
Hyungwook Park, Paul A. Fishwick
Article No.: 18
DOI: 10.1145/1921598.1921602

Queuing networks are used widely in computer simulation studies. Examples of queuing networks can be found in areas such as the supply chains, manufacturing work flow, and internet routing. If the networks are fairly small in size and complexity,...

The stochastic root-finding problem: Overview, solutions, and open questions
Raghu Pasupathy, Sujin Kim
Article No.: 19
DOI: 10.1145/1921598.1921603

The stochastic root-finding problem (SRFP) is that of finding the zero(s) of a vector function, that is, solving a nonlinear system of equations when the function is expressed implicitly through a stochastic simulation. SRFPs are equivalently...

Modeling and simulation of pedestrian behaviors in crowded places
Wee Lit Koh, Suiping Zhou
Article No.: 20
DOI: 10.1145/1921598.1921604

Pedestrian simulation has many applications in computer games, military simulations, and animation systems. A realistic pedestrian simulation requires a realistic pedestrian behavioral model that takes into account the various behavioral aspects...

SubsetTrio: An evolutionary, geometric, and statistical benchmark subsetting framework
Zhanpeng Jin, Allen C. Cheng
Article No.: 21
DOI: 10.1145/1921598.1921605

Motivated by excessively high benchmarking efforts caused by a rapidly expanding design space, increasing system complexity, and prevailing practices based on ad-hoc and subjective schemes, this article seeks to enhance architecture exploration...