4110 search results - page 384 / 822 » Efficient algorithms for the 2-gathering problem |
195
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...
197
Voted
IANDC
2008
15 years 6 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
176
Voted
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...
213
Voted
CP
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
158
click to vote
HT
1991
ACM
15 years 10 months ago
1991
ACM
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...