160 search results - page 28 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
246
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
143
click to vote
EMSOFT
2009
Springer
15 years 7 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
122
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
144
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
107
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...