Sciweavers

1662 search results - page 65 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
NETWORKS
2008
13 years 8 months ago
Decontamination of hypercubes by mobile agents
In this paper we consider the decontamination problem in a hypercube network of size n. The nodes of the network are assumed to be contaminated and they have to be decontaminated ...
Paola Flocchini, Miao Jun Huang, Flaminia L. Lucci...
ICC
2007
IEEE
141views Communications» more  ICC 2007»
14 years 3 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
TOPLAS
2010
101views more  TOPLAS 2010»
13 years 7 months ago
Nomadic pict: Programming languages, communication infrastructure overlays, and semantics for mobile computation
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
Peter Sewell, Pawel T. Wojciechowski, Asis Unyapot...
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
14 years 2 months ago
Faster exploration of high level design alternatives using UML for better partitions
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
Waseem Ahmed, Doug Myers
ICPR
2006
IEEE
14 years 10 months ago
Bayesian Imitation of Human Behavior in Interactive Computer Games
Modern interactive computer games provide the ability to objectively record complex human behavior, offering a variety of interesting challenges to the pattern-recognition communi...
Bernard Gorman, Christian Bauckhage, Christian Thu...