Sciweavers

3663 search results - page 138 / 733
» Problems in the ontology of computer programs
Sort
View
CVPR
2010
IEEE
15 years 6 months 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
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 13 days 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
IPCO
2007
140views Optimization» more  IPCO 2007»
14 years 11 months ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan
DALT
2009
Springer
15 years 4 months ago
Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
Tran Cao Son, Chiaki Sakama
CSCLP
2005
Springer
15 years 3 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel