877 search results - page 98 / 176 » How to Cover a Grammar |
ICRA
1999
IEEE
15 years 5 months ago
1999
IEEE
We presentthe first configurationspacecomputationalgorithm for pairs of rigid parts that move along fixed spatial axes. The motivation is contactanalysisformechanical design of sp...
97
Voted
JAVA
1999
Springer
15 years 5 months ago
1999
Springer
This chapter presents a dynamic denotational semantics of the Java programming language. This semantics covers almost the full range of the base language, excluding only concurrenc...
74
Voted
RANDOM
1998
Springer
15 years 5 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
138
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
106
Voted
EXPCS
2007
15 years 4 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...