Sciweavers

1174 search results - page 29 / 235
» Functional Trees
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 2 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
MPC
2000
Springer
105views Mathematics» more  MPC 2000»
14 years 6 days ago
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Sergei M. Abramov, Robert Glück
ECSQARU
1999
Springer
14 years 28 days ago
An Alternative to Outward Propagation for Dempster-Shafer Belief Functions
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
Norbert Lehmann, Rolf Haenni
FOCS
2009
IEEE
14 years 3 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
COMPSAC
2002
IEEE
14 years 1 months ago
Evaluating Software Maintenance Cost Using Functional Redundancy Metrics
a Abstract— Source code copying for reuse (code cloning) is often observed in software implementations. Such code cloning causes difficulty when software functionalities are mod...
Takeo Imai, Yoshio Kataoka, Tetsuji Fukaya