16504 search results - page 328 / 3301 » New Problems, New Solutions |
203
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
175
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
In this paper, we study the incremental t echnology mapping problem for lookup-table (LUT) based Field Programmable Gate Arrays (FPGAs) under incremental changes. Given a gate-lev...
225
click to vote
ICDE
1998
IEEE
16 years 8 months ago
1998
IEEE
With the growing acceptance of the Internet as a new dissemination medium, several new and interesting challenges arise in building a digital commerce infrastructure. In this arti...
158
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
153
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
This paper introduces and solves a security problem of pervasive computing: how to define authorizations for offline interactions when trust relationships among entities do not ex...