Sciweavers

914 search results - page 115 / 183
» Branch and Bound on the Network Model
Sort
View
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
14 years 11 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
COMCOM
2004
84views more  COMCOM 2004»
14 years 9 months ago
A self-extracting accurate modeling for bounded-delay video services
This article proposes the XGOP-B deterministic traffic model for MPEG video services requiring strict bounds on the quality of service provided by the network. The XGOP-B model ta...
Marcelo Dias de Amorim, Otto Carlos Muniz Bandeira...
RTAS
2009
IEEE
15 years 4 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...
TCS
2008
14 years 9 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
IDEAL
2004
Springer
15 years 3 months ago
Exploiting Safety Constraints in Fuzzy Self-organising Maps for Safety Critical Applications
This paper defines a constrained Artificial Neural Network (ANN) that can be employed for highly-dependable roles in safety critical applications. The derived model is based upon t...
Zeshan Kurd, Tim P. Kelly, Jim Austin