709 search results - page 118 / 142 » On LR(k)-Parsers of Polynomial Size |
TCAD
2002
14 years 9 months ago
2002
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
MST
2007
14 years 9 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
PR
2007
14 years 9 months ago
2007
This paper presents a novel and effective approach to synthesize English handwriting in the user’s writing style. We select the most important features that depict the handwriti...
JAIR
2010
14 years 8 months ago
2010
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
JUCS
2010
14 years 8 months ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...