Sciweavers

522 search results - page 96 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
WICON
2008
13 years 9 months ago
Exploiting parallel networks using dynamic channel scheduling
Many researchers have been focusing on the outcomes and consequences of the rapid increase and proliferation of mobile wireless technologies. If it is not already the case, it wil...
Lara B. Deek, Kevin C. Almeroth, Mike P. Wittie, K...
WICON
2008
13 years 9 months ago
Risk-aware beacon scheduling for tree-based ZigBee/IEEE 802.15.4 wireless networks
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...
Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami
AAAI
2006
13 years 9 months ago
ScriptEase - Motivational Behaviors for Interactive Characters in Computer Role-Playing Games
ScriptEase is a tool that allows authors with no programming experience to create interactive stories for computer role-playing games. Instead of writing scripting code manually, ...
Maria Cutumisu, Duane Szafron, Jonathan Schaeffer,...
AAAI
2006
13 years 9 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
SOQUA
2007
13 years 9 months ago
Designing multi-layers self-adaptive complex applications
The impossibility of statically determining the behavior of complex systems that interact at runtime with heterogeneous devices and remote entities, may lead to unexpected system ...
Davide Lorenzoli, Davide Tosi, Salvatore Venticinq...