Sciweavers

8413 search results - page 325 / 1683
» Ordering Problem Subgoals
Sort
View
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 10 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
WSC
1998
15 years 8 months ago
Reactive Tabu Search in Unmanned Aerial Reconnaissance Simulations
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
Joel L. Ryan, T. Glenn Bailey, James T. Moore, Wil...
WCE
2007
15 years 7 months ago
Local Approximation of Pareto Surface
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
S. V. Utyuzhnikov, Jeremy Maginot, Marin D. Guenov
AIPS
2009
15 years 7 months ago
Ant Search Strategies For Planning Optimization
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
15 years 6 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting