Sciweavers

243 search results - page 42 / 49
» Coverage-biased Random Exploration of Models
Sort
View
WSC
2004
13 years 9 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
JAIR
2006
74views more  JAIR 2006»
13 years 7 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
ATAL
2009
Springer
13 years 8 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
SPAA
1995
ACM
13 years 11 months ago
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias,...
CF
2010
ACM
13 years 11 months ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...