601 search results - page 78 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
113
click to vote
ACL
2009
14 years 11 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
121
click to vote
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
124
click to vote
AAAI
2011
14 years 1 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...
125
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
104
click to vote
ICRA
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, the path following problem of an omnidirectional mobile robot has been studied. Given the error dynamic model derived from the robot state vector and the path st...