94 search results - page 2 / 19 » Testing Whether a Set of Code Words Satisfies a Given Set of... |
COLING
1992
13 years 7 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
COR
2008
13 years 6 months ago
2008
Whether a given nonlinear solver can reach a feasible point for a set of nonlinear constraints depends heavily on the initial point provided. We develop a range of computationally...
AI
2007
Springer
13 years 6 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
ORL
2002
13 years 5 months ago
2002
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
ICEIS
2006
IEEE
14 years 2 days ago
2006
IEEE
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...