293 search results - page 10 / 59 » Possibilistic Networks with Locally Weighted Knowledge Bases |
INFOCOM
2003
IEEE
14 years 29 days ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...
SDM
2010
SIAM
13 years 6 months ago
2010
SIAM
Collaborative filtering is an important topic in data mining and has been widely used in recommendation system. In this paper, we proposed a unified model for collaborative fil...
ADHOC
2007
13 years 7 months ago
2007
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...