840 search results - page 122 / 168 » The Complexity of the Extended GCD Problem |
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...
LICS
2005
IEEE
14 years 2 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
GD
2005
Springer
14 years 2 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
ICWE
2005
Springer
14 years 2 months ago
2005
Springer
As the Web becomes a platform for implementing complex B2C and B2B applications, there is a need to extend Web conceptual modeling to process-centric applications. In this context,...
MIDDLEWARE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...