4117 search results - page 106 / 824 » On the Satisfiability of Complex Constraints |
198
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
159
click to vote
SIROCCO
2008
15 years 7 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
180
click to vote
SPLC
2008
15 years 7 months ago
2008
Modeling self-adaptive applications is a difficult task due to the complex relationships they have with their environments. Designers of such applications strive to model accurate...
157
click to vote
WICSA
2008
15 years 7 months ago
2008
With the spread of the Internet and software evolution in complex intensive systems, software architecture often need be reconfigured during runtime to adapt variable environments...
180
click to vote
AAAI
2006
15 years 7 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...