Sciweavers

236 search results - page 22 / 48
» Learning Teleoreactive Logic Programs from Problem Solving
Sort
View
125
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 1 months ago
CLP-based protein fragment assembly
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
Alessandro Dal Palù, Agostino Dovier, Feder...
AI
2000
Springer
15 years 2 months ago
Learning to construct knowledge bases from the World Wide Web
The World Wide Web is a vast source of information accessible to computers, but understandable only to humans. The goal of the research described here is to automatically create a...
Mark Craven, Dan DiPasquo, Dayne Freitag, Andrew M...
IV
2003
IEEE
98views Visualization» more  IV 2003»
15 years 7 months ago
A new approach to virtual design for spatial configuration problems
In this paper, we present a new framework for the use of Virtual Reality (VR) in engineering design for configuration applications. Traditional VR systems support the visual explo...
Carlos Calderon, Marc Cavazza, Daniel Diaz
CEC
2011
IEEE
14 years 2 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
EMMCVPR
2005
Springer
15 years 7 months ago
Reverse-Convex Programming for Sparse Image Codes
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
Matthias Heiler, Christoph Schnörr