2467 search results - page 363 / 494 » Finite State Machines |
112
click to vote
LPNMR
2001
Springer
15 years 5 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
101
Voted
CAV
2000
Springer
15 years 5 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
110
click to vote
MICRO
1998
IEEE
15 years 5 months ago
1998
IEEE
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
SG
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we investigate how discourse context in the form of short-term memory can be exploited to automatically group consecutive strokes in digital freehand sketching. With...
104
Voted
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...