Sciweavers

1662 search results - page 216 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ECCV
2008
Springer
14 years 10 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
ACMACE
2008
ACM
13 years 11 months ago
Evaluation of a pervasive game for domestic energy engagement among teenagers
In this paper, we present Power Agent - a pervasive game designed to encourage teenagers and their families to reduce energy consumption in the home. The idea behind this mobile p...
Anton Gustafsson, Magnus Bång
DAC
2002
ACM
14 years 9 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...
DAC
2005
ACM
13 years 10 months ago
Power grid simulation via efficient sampling-based sensitivity analysis and hierarchical symbolic relaxation
On-chip supply networks are playing an increasingly important role for modern nanometer-scale designs. However, the ever growing sizes of power grids make the analysis problem ext...
Peng Li
FLAIRS
2003
13 years 10 months ago
LIDS: Learning Intrusion Detection System
The detection of attacks against computer networks is becoming a harder problem to solve in the field of network security. The dexterity of the attackers, the developing technolog...
Mayukh Dass, James Cannady, Walter D. Potter