994 search results - page 153 / 199 » Custom Computing Machines for the Set Covering Problem |
125
Voted
DCOSS
2011
Springer
14 years 8 days ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
WWW
2006
ACM
16 years 1 months ago
2006
ACM
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
120
Voted
COCO
1998
Springer
15 years 4 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
92
Voted
JAL
2008
15 years 14 days ago
2008
Abstract. In the last few years, the microprocessors technologies have been definitely moving to multi-core architectures, in order to improve performances as well as reduce power ...
184
click to vote
Publication
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...