Sciweavers

4524 search results - page 230 / 905
» The Complexity of Global Constraints
Sort
View
OL
2007
133views more  OL 2007»
15 years 6 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
AI
2008
Springer
15 years 6 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne
COMPLEX
2009
Springer
15 years 10 months ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan
RT
1998
Springer
15 years 11 months ago
Three Point Clustering for Radiance Computations
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...
Marc Stamminger, Philipp Slusallek, Hans-Peter Sei...
IWSSD
2000
IEEE
15 years 11 months ago
Design Guidance through the Controlled Application of Constraints
We seek to facilitate development of high quality software designs and architectures by using rigorous process definitions to guide application of the complex structure of relati...
Aaron G. Cass, Leon J. Osterweil