4524 search results - page 227 / 905 » The Complexity of Global Constraints |
195
click to vote
FMCO
2005
Springer
16 years 6 days ago
2005
Springer
Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems....
141
click to vote
RT
2005
Springer
16 years 5 days ago
2005
Springer
This paper describes a new scheme for computing out-of-core global illumination in complex indoor scenes using a photon-mapping approach. Our method makes use of a cells-and-porta...
308
click to vote
AGP
2010
IEEE
15 years 11 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
170
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
198
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...