2926 search results - page 112 / 586 » Partially Optimal Routing |
102
click to vote
IOLTS
2003
IEEE
15 years 6 months ago
2003
IEEE
A methodology for the synthesis of partially selfchecking multilevel logic circuits with low-cost paritybased concurrent error detection (CED) is described. A subset of the inputs...
126
click to vote
PEPM
1994
ACM
15 years 5 months ago
1994
ACM
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
103
click to vote
FLAIRS
2009
14 years 10 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
142
Voted
TACAS
2010
Springer
15 years 8 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
109
click to vote
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...