3946 search results - page 46 / 790 » The computational complexity of choice sets |
117
click to vote
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
ICDS
2007
IEEE
15 years 3 months ago
2007
IEEE
- Role provisioning is an essential yet complex aspect of the design of virtual organisations. This paper addresses an even more complex scenario, that of role provisioning in tele...
119
click to vote
RT
1995
Springer
15 years 3 months ago
1995
Springer
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
We consider a multiagent system whose task is to aid componentcentered design by collaborative designers in a supply chain. In the earlier work, collaborative design networks are ...
LOGCOM
2007
14 years 11 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...