Sciweavers

20294 search results - page 113 / 4059
» Algorithmic Information Theory
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 8 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
CODES
2008
IEEE
15 years 6 months ago
Profiling of lossless-compression algorithms for a novel biomedical-implant architecture
In view of a booming market for microelectronic implants, our ongoing research work is focusing on the specification and design of a novel biomedical microprocessor core targeting...
Christos Strydis, Georgi Gaydadjiev
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 7 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 4 months ago
The MIMO Iterative Waterfilling Algorithm
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
IWC
2008
99views more  IWC 2008»
15 years 4 months ago
Pedagogy and usability in interactive algorithm visualizations: Designing and evaluating CIspace
Interactive algorithm visualizations (AVs) are powerful tools for teaching and learning concepts that are difficult to describe with static media alone. However, while countless A...
Saleema Amershi, Giuseppe Carenini, Cristina Conat...