4066 search results - page 216 / 814 » Almost Complete Sets |
191
click to vote
CORR
2010
Springer
15 years 6 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...
178
click to vote
ICWE
2009
Springer
16 years 1 months ago
2009
Springer
Model-driven engineering is a promising approach, but there are still many hurdles to overcome. The tool UWE4JSF solves the hurdles for the model-driven development of web applicat...
134
click to vote
ICMCS
2007
IEEE
16 years 26 days ago
2007
IEEE
Recently great interest has been shown in the visual surveillance of public transportation systems. The challenge is the automated analysis of passenger’s behaviors with a set o...
180
click to vote
ICOIN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
138
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...