Sciweavers

774 search results - page 25 / 155
» Factors of generalized Fermat numbers
Sort
View
CP
2008
Springer
13 years 10 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
TKDE
2010
149views more  TKDE 2010»
13 years 3 months ago
A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information
The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, requir...
Davide Sottara, Paola Mello, Mark Proctor
CONTEXT
2005
Springer
14 years 2 months ago
An Approach to Data Fusion for Context Awareness
We propose and develop an approach modeled with multi-attribute utility theory for sensor fusion in context-aware environments. Our approach is distinguished from existing general ...
Amir Padovitz, Seng Wai Loke, Arkady B. Zaslavsky,...
IPPS
1999
IEEE
14 years 22 days ago
The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varv...
STACS
1999
Springer
14 years 21 days ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer