Sciweavers

1332 search results - page 163 / 267
» Combinatorial Algorithms
Sort
View
CPAIOR
2010
Springer
14 years 2 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
CIKM
1998
Springer
14 years 1 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
COCOON
2006
Springer
14 years 27 days ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 21 days ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
WSC
2007
13 years 11 months ago
Expecting the unexpected: representing, reasoning about, and assessing construction project contingencies
Planning, scheduling and effective management of contingencies are crucial for the successful management of construction projects. In this paper we explore a mathematical represen...
G. Ryan Anderson, Nilufer Onder, Amlan Mukherjee