Sciweavers

446 search results - page 66 / 90
» A Combinatorial Theorem for Trees
Sort
View
AAAI
1998
15 years 1 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
14 years 12 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
DISOPT
2010
132views more  DISOPT 2010»
14 years 12 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
EOR
2008
136views more  EOR 2008»
14 years 12 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
GIS
2006
ACM
14 years 11 months ago
Swarming methods for geospatial reasoning
Geospatial data is often used to predict or recommend movements of robots, people, or animals ("walkers"). Analysis of such systems can be combinatorially explosive. Eac...
H. Van Dyke Parunak, Sven Brueckner, Robert S. Mat...