Sciweavers

3838 search results - page 308 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
TKDE
2002
141views more  TKDE 2002»
15 years 5 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...
TIFS
2010
137views more  TIFS 2010»
15 years 27 days ago
On the dynamic selection of biometric fusion algorithms
Biometric fusion consolidates the output of multiple biometric classifiers to render a decision about the identity of an individual. We consider the problem of designing a fusion s...
Mayank Vatsa, Richa Singh, Afzel Noore, Arun Ross
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
17 years 6 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...