4903 search results - page 390 / 981 » The Set Covering Machine |
178
click to vote
APPROX
2004
Springer
16 years 1 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
203
click to vote
WG
2004
Springer
16 years 29 days ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
184
click to vote
INFOCOM
2003
IEEE
16 years 27 days ago
2003
IEEE
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
199
click to vote
ISSRE
2003
IEEE
16 years 27 days ago
2003
IEEE
This paper investigates the precision of three linearcomplexity type analyses for Java software: Class Hierarchy Analysis (CHA), Rapid Type Analysis (RTA) and Variable Type Analys...
192
click to vote
CP
2003
Springer
16 years 25 days ago
2003
Springer
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...