805 search results - page 75 / 161 » Combinatorial optimization problems in self-assembly |
103
click to vote
SAGA
2009
Springer
15 years 4 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...
ECML
2007
Springer
15 years 4 months ago
2007
Springer
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
STOC
1995
ACM
15 years 1 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
87
Voted
EAAI
2007
14 years 10 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de�...