840 search results - page 156 / 168 » Inapproximability of Combinatorial Optimization Problems |
CAEPIA
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buyers when trying to determine the best set of prov...
SWAT
1992
Springer
14 years 1 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
CP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
CIKM
2008
Springer
13 years 11 months ago
2008
Springer
Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of ent...
AAAI
2010
13 years 11 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...