268 search results - page 29 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
77
Voted
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
KR
2000
Springer
15 years 1 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
114
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
SRDS
2006
IEEE
15 years 3 months ago
2006
IEEE
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...