Sciweavers

1589 search results - page 178 / 318
» Multiple-Goal Heuristic Search
Sort
View
IJCAI
2001
13 years 10 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
ASE
1998
81views more  ASE 1998»
13 years 8 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 7 months ago
Querying spatial patterns
Spatial data are common in many scientific and commercial domains such as geographical information systems and gene/protein expression profiles. Querying for distribution patterns...
Vishwakarma Singh, Arnab Bhattacharya, Ambuj K. Si...
ICMCS
2005
IEEE
68views Multimedia» more  ICMCS 2005»
14 years 2 months ago
On the Performance Improvement of H.264 Through Foreground and Background Analyses
A more efficient coding scheme for H.264 by heuristically assign macroblock partition types for video foreground and background coding is proposed. High visual quality of foregro...
Zhe-Kuan Lin, Horng-Horng Lin, Yu-Hsin Chen, Jen-H...
ANTSW
2004
Springer
14 years 2 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...