Sciweavers

986 search results - page 111 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 11 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
ICONIP
2007
13 years 10 months ago
Policy Learning for Motor Skills
Policy learning which allows autonomous robots to adapt to novel situations has been a long standing vision of robotics, artificial intelligence, and cognitive sciences. However, ...
Jan Peters, Stefan Schaal
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
14 years 26 days ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
ECCV
2010
Springer
14 years 2 months ago
Visual Recognition With Humans in the Loop
We present an interactive, hybrid human-computer method for object classification. The method applies to classes of objects that are recognizable by people with appropriate expert...
TOOLS
2008
IEEE
14 years 3 months ago
Modeling of Component Environment in Presence of Callbacks and Autonomous Activities
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
Pavel Parizek, Frantisek Plasil