13214 search results - page 2299 / 2643 » Pseudorandomness for network algorithms |
174
click to vote
KCAP
2003
ACM
16 years 2 days ago
2003
ACM
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
174
Voted
SIGMETRICS
2003
ACM
16 years 2 days ago
2003
ACM
—Node movement can be exploited to reduce the energy consumption of wireless network communication. The strategy consists in delaying communication until a mobile node moves clos...
161
click to vote
DSOM
2003
Springer
16 years 1 days ago
2003
Springer
One of the main problems with today's Internet traffic analysis is caused by the large number of network-based applications whose types and traffic patterns are more complicat...
213
click to vote
GECCO
2003
Springer
16 years 1 days ago
2003
Springer
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
161
click to vote
ICANN
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...