1064 search results - page 156 / 213 » Single Tree Grammars |
141
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
114
Voted
PADS
1999
ACM
15 years 7 months ago
1999
ACM
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...
135
click to vote
FCCM
2009
IEEE
15 years 7 months ago
2009
IEEE
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
128
Voted
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
133
Voted
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...