20 search results - page 4 / 4 » On some problems related to palindrome closure |
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
AI
1998
Springer
13 years 4 months ago
1998
Springer
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
FSTTCS
1992
Springer
13 years 9 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
BC
2005
13 years 5 months ago
2005
Abstract Weproposeacomputationalmodelofcontourintegration for visual saliency. The model uses biologically plausible devices to simulate how the representations of elements aligned...
ASPLOS
2004
ACM
13 years 10 months ago
2004
ACM
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...