805 search results - page 149 / 161 » Combinatorial optimization problems in self-assembly |
133
Voted
SWAT
1992
Springer
15 years 7 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...
127
Voted
CP
2006
Springer
15 years 7 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...
130
Voted
AAAI
2010
15 years 5 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...
120
Voted
EAAI
2008
15 years 3 months ago
2008
Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buying agents when trying to determine the best set of provid...
124
Voted
SAGT
2010
Springer
15 years 1 months ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...