Sciweavers

413 search results - page 56 / 83
» Computing and Exploiting Tree-Decompositions for Solving Con...
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
15 years 7 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
BROADNETS
2004
IEEE
15 years 5 months ago
Efficient QoS Provisioning for Adaptive Multimedia in Mobile Communication Networks by Reinforcement Learning
The scarcity and large fluctuations of link bandwidth in wireless networks have motivated the development of adaptive multimedia services in mobile communication networks, where i...
Fei Yu, Vincent W. S. Wong, Victor C. M. Leung
CN
2007
117views more  CN 2007»
15 years 1 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
ATAL
2008
Springer
15 years 3 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
IWANN
1999
Springer
15 years 5 months ago
Support Vector Machines for Multi-class Classification
Abstract: Support vector machines (SVMs) are primarily designed for 2-class classification problems. Although in several papers it is mentioned that the combination of K SVMs can b...
Eddy Mayoraz, Ethem Alpaydin