1421 search results - page 143 / 285 » Algorithms for subsequence combinatorics |
158
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
163
Voted
AI
1998
Springer
15 years 4 months ago
1998
Springer
Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where ...
175
Voted
ASIAN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
153
Voted
VRST
2003
ACM
15 years 10 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
145
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...