1381 search results - page 162 / 277 » Computational Complexity of Constraint Satisfaction |
139
click to vote
TVCG
2002
15 years 3 months ago
2002
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. A...
138
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
— Typical embedded systems must perform rather complex control and communication tasks with severely restricted computing resources. Due to these contraints most systems are sing...
155
click to vote
ICICIC
2006
IEEE
15 years 10 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
151
click to vote
BIRTHDAY
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the con...
157
click to vote
ICSOC
2009
Springer
15 years 1 months ago
2009
Springer
With increasingly complex and heterogeneous systems in pervasive service computing, it becomes more and more important to provide self-protected services to end users. In order to ...