168 search results - page 26 / 34 » On Nontrivial Approximation of CSPs |
SCN
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
INFOCOM
2000
IEEE
14 years 2 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
ATVA
2008
Springer
14 years 11 days ago
2008
Springer
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
CCCG
2007
13 years 12 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...