Sciweavers

199 search results - page 11 / 40
» Complexity of two dual criteria scheduling problems
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
WSCG
2004
148views more  WSCG 2004»
13 years 9 months ago
Inverse Rendering of Polished Materials under Constant Complex Uncontrolled Illumination
Inverse rendering infers realistic descriptions of illumination and material properties from photographs. However, the applicability of state of the art inverse rendering algorith...
Michael Bang Nielsen, Anders Brodersen
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
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...
Heribert Vollmer
INFOCOM
2009
IEEE
14 years 2 months ago
A Theory of QoS for Wireless
—Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control,...
I-Hong Hou, Vivek Borkar, P. R. Kumar
INFOVIS
2000
IEEE
14 years 3 days ago
Interactive Problem Solving via Algorithm Visualization
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
Pearl Pu, Denis Lalanne