1159 search results - page 85 / 232 » Binary Decision Graphs |
145
click to vote
FCT
2009
Springer
16 years 27 days ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
149
click to vote
PASTE
2005
ACM
15 years 12 months ago
2005
ACM
This paper presents Lancet, a multi-platform software visualization tool that enables the inspection of programs at the binary code level. Implemented on top of the linktime rewri...
143
click to vote
TCS
2002
15 years 6 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
152
click to vote
ERSHOV
1999
Springer
15 years 10 months ago
1999
Springer
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
152
click to vote
AIPS
2008
15 years 8 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...