1331 search results - page 167 / 267 » Complexity bounds for zero-test algorithms |
254
click to vote
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
114
click to vote
ICML
2002
IEEE
16 years 4 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
133
click to vote
EACL
2009
ACL Anthology
16 years 3 months ago
2009
ACL Anthology
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
127
click to vote
CSFW
2008
IEEE
15 years 9 months ago
2008
IEEE
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper we analyze the operation of two scheduling algorithms, Class Based Queuing (CBQ) and Delay Bounded Hybrid Proportional Delay (DBHPD). We compare results obtained ...