Sciweavers

2563 search results - page 209 / 513
» Phenomenology, Representations and Complexity
Sort
View
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 11 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
ASPDAC
2006
ACM
123views Hardware» more  ASPDAC 2006»
15 years 11 months ago
Efficient static timing analysis using a unified framework for false paths and multi-cycle paths
- We propose a framework to unify the process of false paths and multi-cycle paths in static timing analysis (STA). We use subgraphs attached with timing constraints to represent f...
Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu, Chung-Kuan...
CONIELECOMP
2004
IEEE
15 years 11 months ago
Representing and Computing Some Configuration Properties for the n-Dimensional Orthogonal Pseudo-Polytopes
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
Antonio Aguilera, Ricardo Pérez-Aguila
ECTEL
2006
Springer
15 years 11 months ago
Semantic Modelling of Learning Objects and Instruction
Abstract. We introduce an ontology-based semantic modelling framework that addresses subject domain modelling, instruction modelling, and interoperability aspects in the developmen...
Claus Pahl, Mark Melia
STACS
2000
Springer
15 years 10 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...