Sciweavers

1512 search results - page 58 / 303
» connection 2006
Sort
View
IEICET
2006
76views more  IEICET 2006»
14 years 9 months ago
Relationship among Complexities of Individual Sequences over Countable Alphabet
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
Shigeaki Kuzuoka, Tomohiko Uyematsu
61
Voted
IJMTM
2006
85views more  IJMTM 2006»
14 years 9 months ago
Simulation in agent-based control systems: MAST case study
: The paper discusses the role of simulation in agent-based control systems. We present the universal runtime interface enabling efficient interactions between the agent control, m...
Pavel Vrba
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
14 years 9 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
ACID
2006
220views Algorithms» more  ACID 2006»
14 years 11 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
GPEM
2006
82views more  GPEM 2006»
14 years 9 months ago
Shortcomings with using edge encodings to represent graph structures
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
Gregory Hornby