No Inv.: 612/AF/Perp/88/1c
No Inv.: 14836-14839/P/Perp/94/4c
No Inv.: 14291-14291/P/Perp/94/2c
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical…
"To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into …
No Inv.: 1430/S/Perp/96/1c
No Inv.: 1555/S/Perp/96/1c
No Inv.: 1472/S/Perp/96/1c
This book is about the process of creating web-based systems (i.e., websites, content, etc.) that consider each of the parts, the modules, the organisms – binary or otherwise – that make up a balanced, sustainable web ecosystem. In the current media-rich environment, a website is more than a collection of relative html documents of text and images on a static desktop computer monitor. There…
No Inv.: 304/AF/Perp/91/1c