Sciweavers

4524 search results - page 107 / 905
» The Complexity of Global Constraints
Sort
View
DAGSTUHL
2004
15 years 2 months ago
Optimal algorithms for global optimization in case of unknown Lipschitz constant
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
Matthias U. Horn
HICSS
2003
IEEE
165views Biometrics» more  HICSS 2003»
15 years 6 months ago
Analysis of the Effectiveness of Global Virtual Teams in Software Engineering Projects
Global software development projects use virtual teams, which are primarily linked through computer and telecommunications technologies across national boundaries. Global Virtual ...
H. Keith Edwards, Varadharajan Sridhar
87
Voted
ICRA
2000
IEEE
111views Robotics» more  ICRA 2000»
15 years 5 months ago
Learning Globally Consistent Maps by Relaxation
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
79
Voted
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 1 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...
102
Voted
ENTCS
2007
112views more  ENTCS 2007»
15 years 18 days ago
A Calculus of Global Interaction based on Session Types
This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. ...
Marco Carbone, Kohei Honda, Nobuko Yoshida