Sciweavers

12659 search results - page 2336 / 2532
» The distributed breakout algorithms
Sort
View
NETGAMES
2006
ACM
16 years 16 days ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
PLDI
2006
ACM
16 years 16 days ago
Automatic instruction scheduler retargeting by reverse-engineering
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
Matthew J. Bridges, Neil Vachharajani, Guilherme O...
SAC
2006
ACM
16 years 16 days ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
SENSYS
2006
ACM
16 years 15 days ago
Interest dissemination with directional antennas for wireless sensor networks with mobile sinks
Introducing mobile data sinks into wireless sensor networks (WSNs) improves the energy efficiency and the network lifetime, and is demanded for many application scenarios, such a...
Yihong Wu, Lin Zhang, Yiqun Wu, Zhisheng Niu
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 15 days ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
« Prev « First page 2336 / 2532 Last » Next »