13621 search results - page 239 / 2725 » Computability and Complexity in Self-assembly |
169
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
143
click to vote
GLOBECOM
2006
IEEE
16 years 20 days ago
2006
IEEE
— We investigate nonlinear precoding techniques for the downlink of multi-user systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile...
145
click to vote
CONCUR
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
155
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
155
click to vote
PG
2003
IEEE
15 years 12 months ago
2003
IEEE
Interactive visualization of complex, real-world light sources has so far not been feasible. In this paper, we present an hardware accelerated direct lighting algorithm based on a...