4797 search results - page 212 / 960 » The complexity of partition tasks |
187
click to vote
ISSTA
1998
ACM
15 years 10 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
149
click to vote
WSC
2007
15 years 8 months ago
2007
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
155
click to vote
SDM
2003
SIAM
15 years 7 months ago
2003
SIAM
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
160
click to vote
WSC
1998
15 years 7 months ago
1998
Simulation is widely used for performance analysis of Personal Communication Systems due to their inherent complexity. However, resource demands (cpu-time and memory requirements)...
176
click to vote
IPL
2002
15 years 6 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...