2446 search results - page 354 / 490 » Choiceless Polynomial Time |
SODA
1990
ACM
13 years 9 months ago
1990
ACM
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
AIPS
2009
13 years 9 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
CADE
2010
Springer
13 years 9 months ago
2010
Springer
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
CIBCB
2009
IEEE
13 years 9 months ago
2009
IEEE
Although Ordinary Differential Equations (ODEs) have been used to model Genetic Regulatory Networks (GRNs) in many previous works, their steady-state behaviors are not well studied...