Sciweavers

3096 search results - page 184 / 620
» The Generalized FITC Approximation
Sort
View
133
Voted
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 5 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
15 years 11 months ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
146
Voted
TSP
2008
115views more  TSP 2008»
15 years 3 months ago
The Estimation of Laplace Random Vectors in Additive White Gaussian Noise
This paper develops and compares the maximum a posteriori (MAP) and minimum mean-square error (MMSE) estimators for spherically contoured multivariate Laplace random vectors in add...
Ivan W. Selesnick
ICRA
2009
IEEE
100views Robotics» more  ICRA 2009»
15 years 2 months ago
Multi-robot plan adaptation by constrained minimal distortion feature mapping
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
Bálint Takács, Yiannis Demiris
AGI
2011
14 years 8 months ago
Multigame Playing by Means of UCT Enhanced with Automatically Generated Evaluation Functions
General Game Playing (GGP) contest provides a research framework suitable for developing and testing AGI approaches in game domain. In this paper, we propose a new modification of...
Karol Waledzik, Jacek Mandziuk