Sciweavers

1532 search results - page 110 / 307
» The Symbol Grounding Problem
Sort
View
CVPR
2010
IEEE
16 years 25 days ago
Tiered Scene Labeling with Dynamic Programming
Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low tre...
Pedro Felzenszwalb, Olga Veksler
GECCO
2009
Springer
122views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolving symmetric and modular neural networks for distributed control
Problems such as the design of distributed controllers are characterized by modularity and symmetry. However, the symmetries useful for solving them are often difficult to determ...
Vinod K. Valsalam, Risto Miikkulainen
LPNMR
2007
Springer
15 years 10 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele
ICTAC
2004
Springer
15 years 9 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
RTA
2010
Springer
15 years 8 months ago
Order-Sorted Unification with Regular Expression Sorts
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
Temur Kutsia, Mircea Marin