Sciweavers

20 search results - page 3 / 4
» Branching Rules for Satisfiability Analysed with Factor Anal...
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 6 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
HICSS
2003
IEEE
137views Biometrics» more  HICSS 2003»
13 years 11 months ago
Adjusting Safety Stock Requirements with an AHP-Based Risk Analysis
In most cases safety stock is determined based on the variability of the demand and lead time. The focus has been on the statistics and past performance, and the existing framewor...
Jukka Korpela, Antti Lehmusvaara, Kalevi Kylä...
BDA
2003
13 years 7 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
BIS
2007
173views Business» more  BIS 2007»
13 years 7 months ago
Natural Language Technology for Information Integration in Business Intelligence
Business intelligence requires the collecting and merging of information from many different sources, both structured and unstructured, in order to analyse for example financial ...
Diana Maynard, Horacio Saggion, Milena Yankova, Ka...
SAC
2010
ACM
14 years 1 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil