994 search results - page 16 / 199 » Custom Computing Machines for the Set Covering Problem |
DAM
2011
13 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
WG
2007
Springer
14 years 1 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
ACHI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we describe an automated system, and its attendant set of techniques and tools, that is able to generate novel multimedia experiences. Using existing online sources,...
ANLP
2000
13 years 9 months ago
2000
Customer care in technical domains is increasingly based on e-mail communication, allowing for the reproduction of approved solutions. Identifying the customer's problem is o...