Sciweavers

236 search results - page 32 / 48
» Learning Teleoreactive Logic Programs from Problem Solving
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
ICALP
2004
Springer
14 years 22 days ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
14 years 2 days ago
Kernel regression for travel time estimation via convex optimization
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
GECCO
2008
Springer
182views Optimization» more  GECCO 2008»
13 years 8 months ago
Scaling ant colony optimization with hierarchical reinforcement learning partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
Erik J. Dries, Gilbert L. Peterson
AOSD
2011
ACM
12 years 11 months ago
An aspect-oriented approach for implementing evolutionary computation applications
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...
Andres J. Ramirez, Adam C. Jensen, Betty H. C. Che...