Sciweavers

2938 search results - page 196 / 588
» On obfuscating point functions
Sort
View
WSC
2007
15 years 8 months ago
Simulation 101 software: workshop and beyond
The C source code associated with the Simulation 101 preconference workshop (offered at the 2006 and 2007 Winter Simulation Conferences) is presented here. This paper begins with ...
Barry Lawson, Lawrence Leemis
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 6 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
IJAR
2007
55views more  IJAR 2007»
15 years 6 months ago
Theoretical analysis and practical insights on importance sampling in Bayesian networks
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
Changhe Yuan, Marek J. Druzdzel
IJCIM
2007
122views more  IJCIM 2007»
15 years 6 months ago
Implementation approach of ERP with mass customization
: This paper analyzes the shortage of traditional ERP systems in the current dynamic and competitive enterprises environment. The new generation ERP system needs to be frequently c...
Y. Zhao, Y. S. Fan
DKE
2002
218views more  DKE 2002»
15 years 6 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...