Sciweavers

2516 search results - page 45 / 504
» When is there a representer theorem
Sort
View
PERCOM
2003
ACM
16 years 5 months ago
Using Semantic Networks for Knowledge Representation in an Intelligent Environment
When building intelligent spaces, the knowledge representation for encapsulating rooms, users, groups, roles, and other information is a fundamental design question. Here we prese...
Stephen Peters, Howard E. Shrobe
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
15 years 11 months ago
On the Locality of Representations
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
Franz Rothlauf
ACL2
2006
ACM
16 years 6 days ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
STACS
1993
Springer
15 years 10 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
SCP
1998
163views more  SCP 1998»
15 years 5 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat