 |
|
|
 International Encyclopedia of the Social Sciences (9 vol. set)
Late in 2004 I received a telephone call from Hélène Potter, director of new product development for Macmillan Reference USA—an imprint of Gale. I did not realize immediately that it was the telephone call that would shape a large share of my intellectual activity for the next three years. In fact, I recall hearing about a... |  |  Representation and Inference for Natural Language: A First Course in Computational Semantics
This book developed out of courses on computational semantics that
the authors jointly taught at the Department of Computational Linguistics, University of the Saarland, Saarbrucken, Germany, in 1995 and
1998, and at ESSLLI'97, the 9th European Summer School in Logic,
Language and Information, Aix-en-Provence, France, in... |  |  Scheduling: Theory, Algorithms, and Systems
Sequencing and scheduling is a formof decision-making that plays a crucial role in manufacturing and service industries. In the current competitive environment effective sequencing and scheduling has become a necessity for survival in the market-place. Companies have to meet shipping dates that have been committed to customers, as failure to... |
|
 Approximation Algorithms for NP-Hard Problems
Approximation algorithms have developed in response to the impossibility of solving
a great variety of important optimization problems. Too frequently, when attempting to
get a solution for a problem, one is confronted with the fact that the problem is NP-haid.
This, in the words of Garey and Johnson, means "I can't find an... |  |  Fedora Bible 2011 Edition: Featuring Fedora Linux 14
With the Fedora Linux operating system and the instructions in this book, you can transform your PC into a safe, powerful, and free computer system. Starting with Fedora, you can easily replace (or coexist with) Microsoft Windows on your everyday desktop computer. You can also configure your computer to share your files, printers, Web pages,... |  |  Parallel Complexity Theory (Research Notes in Theoretical Computers Science)
Parallel complexity theory, the study of resource-bounded parallel computation,
is surely one of the fastest-growing areas of theoretical Computer Science. In the
light of this, it would be foolish to attempt an encyclopedic coverage of the field.
However, it is the belief of the author that its foundations are becoming increas
ingly... |
|
|
Result Page: 14 13 12 11 10 9 8 7 6 5 4 3 2 1 |