300 search results - page 9 / 60 » An extension of the Cayley-Sylvester formula |
KBSE
2008
IEEE
14 years 2 months ago
2008
IEEE
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
JAIR
2000
13 years 7 months ago
2000
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power&qu...
VRML
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, a function-based extension of Extensible 3D (X3D) is proposed. The extension allows authors to use analytical functions to define geometry, color, 3D texture as wel...
AAAI
2000
13 years 9 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...