Sciweavers

363 search results - page 30 / 73
» Partial Multicuts in Trees
Sort
View
AAAI
1996
13 years 11 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
MTPP
2010
13 years 7 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang
WWW
2005
ACM
14 years 10 months ago
Delivering new web content reusing remote and heterogeneous sites. A DOM-based approach
This contribution addresses the development of new web sites reusing already existing contents from external sources. Unlike common links to other resources, which retrieves the w...
Luis Álvarez Sabucedo, Luis E. Anido-Rif&oa...
ISCAS
2008
IEEE
185views Hardware» more  ISCAS 2008»
14 years 4 months ago
A variant of a radix-10 combinational multiplier
— We consider the problem of adding the partial products in the combinational decimal multiplier presented by Lang and Nannarelli. In the original paper this addition is done wit...
Luigi Dadda, Alberto Nannarelli
DEBS
2007
ACM
13 years 11 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma