1677 search results - page 184 / 336 » On the Completeness of Quantum Computation Models |
178
click to vote
FORTE
2009
15 years 4 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
207
click to vote
JMLR
2008
15 years 6 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
198
click to vote
EDOC
2008
IEEE
16 years 1 months ago
2008
IEEE
Service providers as we know them nowadays are the always-on “static” web service providers, that aim at Five9 availability (99.999%). Formal, or de-facto, standards, such as ...
142
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
873
click to vote
Book
It's a complete robotic navigation cookbook!
"This book surveys the state of the art in sensors, systems, methods and technologies utilized by a mobile robot to determin...