1308 search results - page 142 / 262 » Let's Have a Conversation |
139
click to vote
STACS
1997
Springer
15 years 10 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
145
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
151
click to vote
KR
1992
Springer
15 years 10 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
182
click to vote
LOPSTR
1992
Springer
15 years 10 months ago
1992
Springer
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
171
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...