Sciweavers

34 search results - page 5 / 7
» An Efficient Nominal Unification Algorithm
Sort
View
127
Voted
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
16 years 3 months ago
Mining favorable facets
The importance of dominance and skyline analysis has been well recognized in multi-criteria decision making applications. Most previous studies assume a fixed order on the attribu...
Raymond Chi-Wing Wong, Jian Pei, Ada Wai-Chee Fu, ...
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 3 months ago
A Logic Programming Framework for Combinational Circuit Synthesis
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
Paul Tarau, Brenda Luderman
MSN
2007
Springer
110views Sensor Networks» more  MSN 2007»
15 years 9 months ago
A Location Aided Flooding Protocol for Wireless Ad Hoc Networks
Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates ex...
Xinxin Liu, Xiaohua Jia, Hai Liu, Li Feng
SPAA
1996
ACM
15 years 7 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 7 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein