1686 search results - page 240 / 338 » Programs as polygraphs: computability and complexity |
137
Voted
CHES
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
122
Voted
DSN
2009
IEEE
15 years 10 months ago
2009
IEEE
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
127
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
132
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evoluti...
132
click to vote
AOSD
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents our extension to AspectJ for distributed computing. Although AspectJ allows Java developers to modularize a crosscutting concern as an aspect, this paper shows...