Sciweavers

835 search results - page 122 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
ICDCS
2000
IEEE
14 years 1 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 10 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 2 months ago
Use of a genetic algorithm in brill's transformation-based part-of-speech tagger
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
Garnett Carl Wilson, Malcolm I. Heywood
CVPR
2007
IEEE
14 years 11 months ago
On Constant Focal Length Self-Calibration From Multiple Views
We investigate the problem of finding the metric structure of a general 3D scene viewed by a moving camera with square pixels and constant unknown focal length. While the problem ...
Adrien Bartoli, Alain Crouzil, Benoît Bocqui...
CAV
2010
Springer
190views Hardware» more  CAV 2010»
14 years 9 days ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...