1242 search results - page 80 / 249 » The Theory of Grammar Constraints |
157
click to vote
ISMVL
2009
IEEE
16 years 25 days ago
2009
IEEE
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
165
click to vote
SARA
2009
Springer
16 years 22 days ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
172
click to vote
QOSIP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
143
click to vote
IROS
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract— Direct physical human-robot interaction has become a central part in the research field of robotics today. To use the advantages of the potential for humans and robots...
160
click to vote
ATAL
2007
Springer
16 years 11 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...