Sciweavers

2609 search results - page 288 / 522
» Models for Global Constraint Applications
Sort
View
COMPUTER
2002
89views more  COMPUTER 2002»
15 years 4 months ago
A Pattern for Softcoded Values
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...
Michael R. Blaha, Cheryl Smith
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
16 years 5 months ago
Efficient Macromodeling for On-Chip Interconnects
The improved T and improved n models are proposed for onchip interconnect macromodeling. Using global approximations, simple approximation frames are derived and applied to modeli...
Qinwei Xu, Pinaki Mazumder
IDA
2007
Springer
15 years 10 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 8 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
DGO
2007
168views Education» more  DGO 2007»
15 years 6 months ago
A distributed event-triggered knowledge sharing system
Government agencies globally are facing problems such as illegal immigration, terrorism, and disease diagnosis and control. Solutions to these problems rely heavily on collaborati...
Seema Degwekar, Jeff DePree, Stanley Y. W. Su, How...