1378 search results - page 253 / 276 » The Tractability of Global Constraints |
151
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
223
click to vote
SACMAT
2009
ACM
16 years 18 days ago
2009
ACM
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
180
click to vote
ATAL
2007
Springer
16 years 8 days ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
166
click to vote
CP
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to...
146
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...