Sciweavers

679 search results - page 36 / 136
» Algorithmic modifications to SPIHT
Sort
View
115
Voted
ICNP
1998
IEEE
15 years 6 months ago
A Class of End-to-End Congestion Control Algorithms for the Internet
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
S. Jamaloddin Golestani, S. Bhattacharyya
ATAL
2008
Springer
15 years 4 months ago
Optimized algorithms for multi-agent routing
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
Akihiro Kishimoto, Nathan R. Sturtevant
207
Voted
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
16 years 3 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
CSCLP
2008
Springer
15 years 4 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig
DMIN
2006
137views Data Mining» more  DMIN 2006»
15 years 4 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai