22 search results - page 3 / 5 » A survey of the multiplier conjecture |
LREC
2008
13 years 6 months ago
2008
The present communication brings to the fore the work undertaken at IRCAM within CAL within the framework of the language planning of Amazigh, particularly on the side of terminol...
CSR
2008
Springer
13 years 5 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
IESA
2007
13 years 6 months ago
2007
Increased performance is the key reason for developing software with virtual teams but the research efforts to date are limited. Difficulties for a formal, generic approach are mul...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
AIM
2000
13 years 5 months ago
2000
This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perceptio...