1795 search results - page 295 / 359 » On the Complexity of Circuit Satisfiability |
SIROCCO
2008
13 years 11 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...
SPLC
2008
13 years 11 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...
WICON
2008
13 years 11 months ago
2008
Wireless connectivity for vehicles is a fast-growing market, with a plethora of different network technologies already in use. Surveys of the numbers of IEEE 802.11b/g access poin...
WICSA
2008
13 years 11 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...
AAAI
2006
13 years 11 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...