2165 search results - page 337 / 433 » cases 2005 |
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
MIDDLEWARE
2005
Springer
15 years 3 months ago
2005
Springer
The need for an efficient service management system in an ad-hoc network is obvious. Mobile nodes – and with them the services they provide – frequently enter and leave the ne...
104
click to vote
MIDDLEWARE
2005
Springer
15 years 3 months ago
2005
Springer
Pervasive and ad hoc computing applications are frequently deployed in dynamic networks. Due to mobility of the computing nodes, their unreliability, or a limited communication ra...