Sciweavers

15073 search results - page 299 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ICRA
2007
IEEE
140views Robotics» more  ICRA 2007»
15 years 11 months ago
Recognising and Modelling Landmarks to Close Loops in Outdoor SLAM
Abstract— In this paper, simultaneous localisation and mapping (SLAM) is combined with landmark recognition to close large loops in unstructured, outdoor environments. Camera and...
Fabio T. Ramos, Juan Nieto, Hugh F. Durrant-Whyte
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
15 years 8 months ago
Evaluation relaxation using substructural information and linear estimation
The paper presents an evaluation-relaxation scheme where a fitness surrogate automatically adapts to the problem structure and the partial contributions of subsolutions to the fit...
Kumara Sastry, Cláudio F. Lima, David E. Go...
WCE
2007
15 years 5 months ago
Optimizing Designs based on Risk Approach
— In this paper a new approach to optimize nuclear power plant designs based on global risk reduction are described. In design the focus is on as components quality as redundancy...
Jorge E. Núñez Mc Leod, Selva S. Riv...
PDCAT
2005
Springer
15 years 10 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
15 years 8 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza