Sciweavers

451 search results - page 36 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
ILP
2004
Springer
14 years 2 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
AAAI
1997
13 years 10 months ago
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
Frank Klassner, Victor R. Lesser, Hamid Nawab
FOCS
2009
IEEE
14 years 3 months ago
On Allocating Goods to Maximize Fairness
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khan...
ICIG
2009
IEEE
13 years 6 months ago
Illumination Invariant Object Tracking with Incremental Subspace Learning
In this paper, we present an efficient and robust subspace learning based object tracking algorithm with special illumination handling. Illumination variances pose a great challen...
Gang Yu, Hongtao Lu
ICRA
1998
IEEE
118views Robotics» more  ICRA 1998»
14 years 29 days ago
A General Theory for Positioning and Orienting 2D Polygonal or Curved Parts using Intelligent Motion Surfaces
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...
Murilo G. Coutinho, Peter M. Will