625 search results - page 23 / 125 » Approximating Travel Times Using Opportunistic Networking |
102
Voted
AAAI
2000
14 years 11 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
EOR
2010
14 years 9 months ago
2010
-- The classical Wardrop System Optimum (SO) assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of...
103
click to vote
IMC
2010
ACM
14 years 7 months ago
2010
ACM
Despite many years of work in wireless mesh networks built using 802.11 radios, the performance and behavior of these networks in the wild is not well-understood. This lack of und...
72
Voted
ICANN
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a method that combines Mutual Information and k-Nearest Neighbors approximator for time series prediction. Mutual Information is used for input selection. K-Nea...
SASO
2007
IEEE
15 years 3 months ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...