Sciweavers

13841 search results - page 409 / 2769
» Algorithms and Constraint Programming
Sort
View
EOR
2008
107views more  EOR 2008»
15 years 7 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
216
Voted
AIPS
2009
15 years 8 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
193
Voted
IOR
2007
106views more  IOR 2007»
15 years 6 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
202
Voted
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 7 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
IJCAI
2003
15 years 8 months ago
Automatic Video Interpretation: A Novel Algorithm for Temporal Scenario Recognition
This paper presents a new scenario recognition algorithm for Video Interpretation. We represent a scenario model by specifying the characters involved in the scenario, the sub-sce...
Van-Thinh Vu, François Brémond, Moni...