Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 31710 dari 34195, Total: 341948 data)

Better Scripts, Better Games

Nama Pengarang : Yanuar H, Mohammad, Affandi, Achmad, Arseno, Dharu, Yulianto, Fazmah Arif, Denning, Peter J. , Wahidah, Ida, Stone, Randi, Urbanska, Wanda, Harel, David, Wall, Kate, Patterson, David A.
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 42-47
Abstraksi Narasi : Smarter, more powerful scripting languages will improve game performance while making gameplay development more efficient.

Woman in computing-take 2

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 68-76
Abstraksi Narasi : Inspiring, recruiting, and retaining, womwn for s career in comuting remains a challenge.

Toward 2w, Beyond Web 2.0

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 52-59
Abstraksi Narasi : 2w is a result of the exponentially growing Web building on itself to move from a Web of content to a Web of applications.

The Complexity of Computing a Nash Equilibrium

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 89-97
Abstraksi Narasi : How lonh does is take until economic agents converge to an equilibrium? By studying the complexity of the problem of computing a mixed Nash equilibrium in a game, we provide avedence that there are game in which convergence to such an aquilibrium takes prohibitivety long. Traditionlly, computational problems fal into to classes: those that have a polynomial-time algorithm and those that are NP-hard. However, the concept of NP-hardness cannot be applied to the rare problems where "every instance has a solution"-for example, in these case of game Nash's theorem assert that every game has is mixed equilibrium (now known as the Nash equilibrium, in honor of that result). We show that finding a Nash equilibrium is complete for a class problems called PPAD, containing several other know hard problems; all problems in PPAD share the same style of proof that every instance has a solution.

Privacy and Security International Communications Surveillance

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 26-28
Abstraksi Narasi : Aren`t we all foreigners when our Internet traffic transits through other countries and is subject to regional intellegence-gathering policies?

Point/Counterpoint Network Nuetrality Nuances

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 31-34
Abstraksi Narasi : A discussion of devergent path to unrestricted acces of content and alications via the internet.

Parallel Programming with Transactional Merory

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 38-43
Abstraksi Narasi : While still rimarily a research project, transactional memory shows promise for making parallel programing easier.

Making Sense of Sensors

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 14-15
Abstraksi Narasi : Researchers are recognizing the potential of position sensors to help them overcome the limitations of traditional user interfaces.

Inside Risk U.S. Election After-Math

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 29
Abstraksi Narasi : Recounting problems still associeted with election integrity, transparency, and accountability.

Improving Perfomance on the Internet

Nama Pengarang : -
Nama Majalah/Jurnal : Communications of the ACM
Volume / Nomor Edisi : -
Nomor Halaman : 44-51
Abstraksi Narasi : Given the Internet`s bottlenecks, how can we build fast, scalable, content-delivery systems?
← Kembali ke Halaman Utama