3875 search results - page 675 / 775 » Approximation algorithms for the 0-extension problem |
SIROCCO
2010
14 years 11 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
A radio frequency identifier (RFID) system consists of inexpensive, uniquely identifiable tags that are mounted on physical objects, and readers that track these tags (and hence...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
In several agent-oriented scenarios in the real world, an autonomous agent that is situated in an unknown environment must learn through a process of trial and error to take actio...
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...