2109 search results - page 221 / 422 » Solving Necklace Constraint Problems |
172
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We explore the problem of reconstructing an image from a bag of square, non-overlapping image patches, the jigsaw puzzle problem. Completing jigsaw puzzles is challenging and requ...
145
click to vote
GECCO
2009
Springer
16 years 21 days ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
157
click to vote
PIMRC
2008
IEEE
16 years 16 days ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
172
click to vote
ECWEB
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. e-Procurement is an Internet-based business process for obtaining materials and services and managing their inflow into the organization. In this paper we develop multia...
137
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...