Sciweavers

699 search results - page 129 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
DAC
2006
ACM
15 years 10 months ago
Optimality study of resource binding with multi-Vdds
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
Deming Chen, Jason Cong, Yiping Fan, Junjuan Xu
62
Voted
MLG
2007
Springer
15 years 3 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
CCS
2007
ACM
15 years 3 months ago
A simple and expressive semantic framework for policy composition in access control
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
Glenn Bruns, Daniel S. Dantas, Michael Huth
GECCO
2007
Springer
165views Optimization» more  GECCO 2007»
15 years 3 months ago
Peptide detectability following ESI mass spectrometry: prediction using genetic programming
The accurate quantification of proteins is important in several areas of cell biology, biotechnology and medicine. Both relative and absolute quantification of proteins is often d...
David C. Wedge, Simon J. Gaskell, Simon J. Hubbard...
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz